Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques, Michel Goemans; Klaus Jansen; Jose D.P. Rolim; Luc

Автор: Chandra Chekuri; Klaus Jansen; Jos? D.P. Rolim; Lu
Название: Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
ISBN: 3540282394 ISBN-13(EAN): 9783540282396
Издательство: Springer
Рейтинг:
Цена: 93160.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: 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.

Автор: Ashish Goel; Klaus Jansen; Jos? Rolim; Ronitt Rubi
Название: Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
ISBN: 3540853626 ISBN-13(EAN): 9783540853626
Издательство: Springer
Рейтинг:
Цена: 97820.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: 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.

Автор: Irit Dinur; Klaus Jansen; Seffi Naor; Jos? Rolim
Название: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
ISBN: 3642036848 ISBN-13(EAN): 9783642036842
Издательство: Springer
Рейтинг:
Цена: 121110.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: 12th International Workshop APPROX 2009 and 13th International Workshop RANDOM 2009 Berkeley CA USA. .

Автор: Klaus Jansen; Samir Khuller
Название: Approximation Algorithms for Combinatorial Optimization
ISBN: 3540679960 ISBN-13(EAN): 9783540679967
Издательство: Springer
Рейтинг:
Цена: 65210.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The topics dealt with include design and analysis of approximation algorithms, inapproximibility results, randomization techniques, average-case analysis, scheduling problems, cuts and connectivity, packing and covering, geometric problems, network design, and various applications.

Автор: Korte, Bernhard, Vygen, Jens
Название: Combinatorial Optimization (algorithms and Combinatorics 21) 5th ed.
ISBN: 3642244874 ISBN-13(EAN): 9783642244872
Издательство: Springer
Рейтинг:
Цена: 60510.00 T
Наличие на складе: Невозможна поставка.
Описание: This comprehensive textbook on combinatorial optimization places special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It is based on numerous courses on combinatorial optimization and specialized topics, mostly at graduate level. This book reviews the fundamentals, covers the classical topics (paths, flows, matching, matroids, NP-completeness, approximation algorithms) in detail, and proceeds to advanced and recent topics, some of which have not appeared in a textbook before. Throughout, it contains complete but concise proofs, and also provides numerous exercises and references. This fifth edition has again been updated, revised, and significantly extended, with more than 60 new exercises and new material on various topics, including Cayley's formula, blocking flows, faster b-matching separation, multidimensional knapsack, multicommodity max-flow min-cut ratio, and sparsest cut. Thus, this book represents the state of the art of combinatorial optimization.

Автор: Schrijver Alexander
Название: Combinatorial Optimization / Polyhedra and Efficiency
ISBN: 3540443894 ISBN-13(EAN): 9783540443896
Издательство: Springer
Рейтинг:
Цена: 113660.00 T
Наличие на складе: Поставка под заказ.
Описание: This book offers an in-depth overview of polyhedral methods and efficient algorithms in combinatorial optimization.These methods form a broad, coherent and powerful kernel in combinatorial optimization, with strong links to discrete mathematics, mathematical programming and computer science. In eight parts, various areas are treated, each starting with an elementary introduction to the area, with short, elegant proofs of the principal results, and each evolving to the more advanced methods and results, with full proofs of some of the deepest theorems in the area. Over 4000 references to further research are given, and historical surveys on the basic subjects are presented.

Автор: Dorit Hochbaum; Klaus Jansen; Jose D.P. Rolim; Ali
Название: Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques
ISBN: 3540663290 ISBN-13(EAN): 9783540663294
Издательство: Springer
Рейтинг:
Цена: 65210.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This text presents various new results within the areas covered by the workshop.

Автор: Andrea Lodi; Michela Milano; Paolo Toth
Название: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
ISBN: 3642135196 ISBN-13(EAN): 9783642135194
Издательство: Springer
Рейтинг:
Цена: 69870.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Constitutes the refereed proceedings of the 7th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR 2010, held in Bologna, Italy, in June 2010.

Автор: Martin Gr?tschel; Laszlo Lovasz; Alexander Schrijv
Название: Geometric Algorithms and Combinatorial Optimization
ISBN: 3642782426 ISBN-13(EAN): 9783642782428
Издательство: Springer
Рейтинг:
Цена: 121110.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Moreover, despite the success of the interior point methods for the solution of explicitly given linear programs there is still no method known that solves implicitly given linear programs, such as those described in this book, and that is both practically and theoretically efficient.

Автор: Jose D.P. Rolim; Salil Vadhan
Название: Randomization and Approximation Techniques in Computer Science
ISBN: 3540441476 ISBN-13(EAN): 9783540441472
Издательство: Springer
Рейтинг:
Цена: 65210.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Constituting the proceedings of the 6th International Workshop on Randomization and Approximation Techniques in Computer Science, the papers presented here address such topics as: coding; geometric computations; graph colourings; random hyper-graphs; graph computations and lattice computations.

Автор: Klaus Jansen; Stefano Leonardi; Vijay Vazirani
Название: Approximation Algorithms for Combinatorial Optimization
ISBN: 3540441867 ISBN-13(EAN): 9783540441861
Издательство: Springer
Рейтинг:
Цена: 65210.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: 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.

Автор: Willem-Jan van Hoeve; Elvin Coban
Название: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
ISBN: 3642019285 ISBN-13(EAN): 9783642019289
Издательство: Springer
Рейтинг:
Цена: 65210.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Constitutes the refereed proceedings of the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR 2009, held in Pittsburgh, PA, USA, in May 2009.