Approximation Algorithms for Combinatorial Optimization, Klaus Jansen; Stefano Leonardi; Vijay Vazirani

Автор: Sundaram, Rangarajan K.
Название: A First Course in Optimization Theory
ISBN: 0521497701 ISBN-13(EAN): 9780521497701
Издательство: Cambridge Academ
Рейтинг:
Цена: 6811.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book, first published in 1996, introduces students to optimization theory and its use in economics and allied disciplines.

Название: Handbook of Combinatorial Optimization. Print + eReference Information Print + eReference
ISBN: 1461439752 ISBN-13(EAN): 9781461439752
Издательство: Springer
Рейтинг:
Цена: 436734.00 р.
Наличие на складе: Поставка под заказ.

Описание: Handbook of Combinatorial Optimization

Автор: Schrijver Alexander
Название: Combinatorial Optimization / Polyhedra and Efficiency
ISBN: 3540443894 ISBN-13(EAN): 9783540443896
Издательство: Springer
Рейтинг:
Цена: 17049.00 р.
Наличие на складе: Поставка под заказ.

Описание: 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.

Автор: Wolsey, Laurence A. (universite Catholique De Louv
Название: Integer and combinatorial optimization
ISBN: 0471359432 ISBN-13(EAN): 9780471359432
Издательство: Wiley
Рейтинг:
Цена: 24861.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Discrete optimization models are used to tackle a wide variety of problems in many fields, including operations research, management science, engineering, and mathematics. Written by two internationally recognized integer programming experts, this book presents the mathematical foundations, theory, and algorithms of discrete optimization methods.

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

Описание: 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
Рейтинг:
Цена: 14673.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: 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.

Автор: Sanjeev Arora; Klaus Jansen; Jose D.P. Rolim; Amit
Название: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
ISBN: 3540407707 ISBN-13(EAN): 9783540407706
Издательство: Springer
Рейтинг:
Цена: 10480.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Автор: Michel Goemans; Klaus Jansen; Jose D.P. Rolim; Luc
Название: Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
ISBN: 3540424709 ISBN-13(EAN): 9783540424703
Издательство: Springer
Рейтинг:
Цена: 9781.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: 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; Samir Khuller
Название: Approximation Algorithms for Combinatorial Optimization
ISBN: 3540679960 ISBN-13(EAN): 9783540679967
Издательство: Springer
Рейтинг:
Цена: 9781.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.

Автор: Giorgio Ausiello; M. Lucertini
Название: Analysis and Design of Algorithms in Combinatorial Optimization
ISBN: 3211816267 ISBN-13(EAN): 9783211816264
Издательство: Springer
Рейтинг:
Цена: 12157.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Автор: Dorit Hochbaum; Klaus Jansen; Jose D.P. Rolim; Ali
Название: Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques
ISBN: 3540663290 ISBN-13(EAN): 9783540663294
Издательство: Springer
Рейтинг:
Цена: 9781.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This text presents various new results within the areas covered by the workshop.

Автор: Andreas S. Schulz; Martin Skutella; Sebastian Stil
Название: Gems of Combinatorial Optimization and Graph Algorithms
ISBN: 3319249703 ISBN-13(EAN): 9783319249704
Издательство: Springer
Рейтинг:
Цена: 9781.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.