Algorithms for Approximation, Armin Iske; Jeremy Levesley
Автор: G?rtner, Matousek Название: Approximation Algorithms and Semidefinite Programming ISBN: 3642220142 ISBN-13(EAN): 9783642220142 Издательство: Springer Рейтинг: Цена: 9781.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Semidefinite programs constitute one of the largest classes of optimization problems that can be solved with reasonable efficiency - both in theory and practice. They play a key role in a variety of research areas, such as combinatorial optimization, approximation algorithms, computational complexity, graph theory, geometry, real algebraic geometry and quantum computing. This book is an introduction to selected aspects of semidefinite programming and its use in approximation algorithms. It covers the basics but also a significant amount of recent and more advanced material. There are many computational problems, such as MAXCUT, for which one cannot reasonably expect to obtain an exact solution efficiently, and in such case, one has to settle for approximate solutions. For MAXCUT and its relatives, exciting recent results suggest that semidefinite programming is probably the ultimate tool. Indeed, assuming the Unique Games Conjecture, a plausible but as yet unproven hypothesis, it was shown that for these problems, known algorithms based on semidefinite programming deliver the best possible approximation ratios among all polynomial-time algorithms. This book follows the “semidefinite side” of these developments, presenting some of the main ideas behind approximation algorithms based on semidefinite programming. It develops the basic theory of semidefinite programming, presents one of the known efficient algorithms in detail, and describes the principles of some others. It also includes applications, focusing on approximation algorithms.
Автор: Evripidis Bampis; Klaus Jansen Название: Approximation and Online Algorithms ISBN: 3642124496 ISBN-13(EAN): 9783642124495 Издательство: Springer Рейтинг: Цена: 9781.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Constitutes the refereed post workshop proceedings of the 7th International Workshop on Approximation and Online Algorithms, WAOA 2009, held in Copenhagen, Denmark, in September 2009 as part of the ALGO 2009 conference event.
Автор: Emmanuil H Georgoulis; Armin Iske; Jeremy Levesley Название: Approximation Algorithms for Complex Systems ISBN: 3642266657 ISBN-13(EAN): 9783642266652 Издательство: Springer Рейтинг: Цена: 29209.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание:
Part I INVITED SURVEYS: Emergent Behaviour in Large Electrical Networks by D. P. Almond, C.J. Budd, N.J. McCullen.- Algorithms and Error Bounds for Multivariate Piecewise Constant Approximation by O. Davydov.- Anisotropic Triangulation Methods in Adaptive Image Approximation by L. Demaret, A. Iske.- Form Assessment in Coordinate Metrology by A.B. Forbes and H.D.Minh.- Discontinuous Galerkin Methods for Linear Problems: An Introduction by E. H. Georgoulis.- A Numerical Analyst's View of the Lattice Boltzmann Method by A. G. Gorban, J. Levesley, D. Packwood.- Approximating Probability Measures on Manifolds via Radial Basis Functions by J. Levesley, X. Sun.- Part II CONTRIBUTED RESEARCH PAPERS: Modelling Clinical Decay Data Using Exponential Functions by M.G. Cox.- Towards Calculating the Basin of Attraction of Non-Smooth Dynamical Systems Using Radial Basis Functions by P. Giesl.- Stabilizing Lattice Boltzmann Simulation of Fluid Flow past a Circular Cylinder with Ehrenfests' Limiter by T.S. Khan, J. Levesley.- Fast and Stable Interpolation of Well Data Using the Norm Function by B. Li, J. Levesley.- Algorithms and Literate Programs for Weighted Low-Rank Approximation with Missing Data by I. Markovsky.- On Bivariate Interpolatory Mask Symbols, Subdivision and Refinable Functions by A. F. Rabarison, J. de Villiers.- Model and Feature Selection in Metrology Data Approximation by X. Yang, A. B. Forbes.
Описание: Contains 41 reviewed papers, selected by the two program committees from a total of 101 submissions. Among the issues addressed are design and analysis of approximation algorithms, hardness of approximation, small space and data streaming algorithms, sub-linear time algorithms, embeddings and metric space methods, and more.
Автор: Klaus Jansen; Monaldo Mastrolilli Название: Approximation and Online Algorithms ISBN: 3319517406 ISBN-13(EAN): 9783319517407 Издательство: Springer Рейтинг: Цена: 7685.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the thoroughly refereed post-workshop proceedings of the 14th International Workshop on Approximation and Online Algorithms, WAOA 2016, held in Aarhus, Denmark, in August 2016 as part of ALGO 2016.
Автор: Evripidis Bampis; Ola Svensson Название: Approximation and Online Algorithms ISBN: 3319182625 ISBN-13(EAN): 9783319182629 Издательство: Springer Рейтинг: Цена: 6708.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the thoroughly refereed post-workshop proceedings of the 12th International Workshop on Approximation and Online Algorithms, WAOA 2014, held in Wroclaw, Poland, in September 2014 as part of ALGO 2014.
Автор: Laura Sanit?; Martin Skutella Название: Approximation and Online Algorithms ISBN: 3319286838 ISBN-13(EAN): 9783319286839 Издательство: Springer Рейтинг: Цена: 6708.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the thoroughly refereed post-workshop proceedings of the 13th International Workshop on Approximation and Online Algorithms, WAOA 2015, held in Patras, Greece, in September 2015 as part of ALGO 2015.The 17 revised full papers presented were carefully reviewed and selected from 40 submissions.
Описание: These are the joint refereed proceedings of the 4th International Workshop on Approximation Algorithms for Optimization Problems, APPROX 2001 and of the 5th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2001.
Автор: Klaus Jansen; Jose Rolim Название: Approximation Algorithms for Combinatorial Optimization ISBN: 3540647368 ISBN-13(EAN): 9783540647362 Издательство: Springer Рейтинг: Цена: 9781.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: A volume of 17 papers from a workshop on approximation algorithms for combinatorial optimization. They address the design and analysis of approximation algorithms, inapproximability results, on-line problems, randomization techniques, average-case analysis, scheduling problems, and applications.
Описание: This text presents various new results within the areas covered by the workshop.
Автор: Harold Kushner; G. George Yin Название: Stochastic Approximation and Recursive Algorithms and Applications ISBN: 1441918477 ISBN-13(EAN): 9781441918475 Издательство: Springer Рейтинг: Цена: 20962.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book presents a thorough development of the modern theory of stochastic approximation or recursive stochastic algorithms for both constrained and unconstrained problems. This second edition is a thorough revision, although the main features and structure remain unchanged.
Автор: Vijay V. Vazirani Название: Approximation Algorithms ISBN: 3642084699 ISBN-13(EAN): 9783642084690 Издательство: Springer Рейтинг: Цена: 7685.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Covering the basic techniques used in the latest research work, the author consolidates progress made so far, including some very recent and promising results, and conveys the beauty and excitement of work in the field.
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
