Описание: Constitutes the joint refereed proceedings of the 11th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2008 and the 12th International Workshop on Randomization and Computation, RANDOM 2008, held in Boston, MA, USA, in August 2008. This book reviews 20 revised papers of the APPROX 2008 workshop.
Автор: 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.
Автор: 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.
Описание: This text presents various new results within the areas covered by the workshop.
Автор: Vazirani Vijay V. Название: Approximation Algorithms ISBN: 3540653678 ISBN-13(EAN): 9783540653677 Издательство: Springer Рейтинг: Цена: 9781.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.
Автор: 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.
Описание: 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.
Автор: Klaus Jansen; Stefano Leonardi; Vijay Vazirani Название: Approximation Algorithms for Combinatorial Optimization ISBN: 3540441867 ISBN-13(EAN): 9783540441861 Издательство: Springer Рейтинг: Цена: 9781.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Compiled from the proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, this volume contains 20 revised full papers. Coverage includes design and analysis of approximation algorithms, inapproximability results and online problems.
Описание: 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.
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
