Gems of Combinatorial Optimization and Graph Algorithms, Schulz Andreas S., Skutella Martin, Stiller Sebastian
Автор: Andreas S. Schulz; Martin Skutella; Sebastian Stil Название: Gems of Combinatorial Optimization and Graph Algorithms ISBN: 3319249703 ISBN-13(EAN): 9783319249704 Издательство: Springer Рейтинг: Цена: 8537.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Are you looking for new lectures for your course on algorithms, combinatorial optimization, or algorithmic game theory? This volume is aimed at readers with some familiarity of combinatorial optimization, and appeals to researchers, graduate students, and advanced undergraduate students alike.
Автор: Takuro Fukunaga; Ken-ichi Kawarabayashi Название: Combinatorial Optimization and Graph Algorithms ISBN: 9811061467 ISBN-13(EAN): 9789811061462 Издательство: Springer Рейтинг: Цена: 13415.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Covering network designs, discrete convex analysis, facility location and clustering problems, matching games, and parameterized complexity, this book discusses theoretical aspects of combinatorial optimization and graph algorithms.
Описание: Covering network designs, discrete convex analysis, facility location and clustering problems, matching games, and parameterized complexity, this book discusses theoretical aspects of combinatorial optimization and graph 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.
Описание: 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.
Описание: 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; Stefano Leonardi; Vijay Vazirani Название: Approximation Algorithms for Combinatorial Optimization ISBN: 3540441867 ISBN-13(EAN): 9783540441861 Издательство: Springer Рейтинг: Цена: 8537.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.
Описание: This text presents various new results within the areas covered by the workshop.
Автор: Klaus Jansen; Samir Khuller Название: Approximation Algorithms for Combinatorial Optimization ISBN: 3540679960 ISBN-13(EAN): 9783540679967 Издательство: Springer Рейтинг: Цена: 8537.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: 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.
Автор: Martin Gr?tschel; Laszlo Lovasz; Alexander Schrijv Название: Geometric Algorithms and Combinatorial Optimization ISBN: 3642782426 ISBN-13(EAN): 9783642782428 Издательство: Springer Рейтинг: Цена: 15855.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: 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.
Автор: Korte Bernhard, Vygen Jens Название: Combinatorial Optimization: Theory and Algorithms ISBN: 3662585669 ISBN-13(EAN): 9783662585665 Издательство: Springer Рейтинг: Цена: 7927.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: 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 sixth edition has again been updated, revised, and significantly extended. Among other additions, there are new sections on shallow-light trees, submodular function maximization, smoothed analysis of the knapsack problem, the (ln 4+?)-approximation for Steiner trees, and the VPN theorem. Thus, this book continues to represent the state of the art of combinatorial optimization.
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
