The Design of Approximation Algorithms
- ISBN-10
- 1139077759
- ISBN-13
- 9781139077750
- Series
- The Design of Approximation Algorithms
- Category
- Approximation theory
- Pages
- 518
- Language
- English
- Published
- 2014-05-14
- Authors
- David P. Williamson, David Bernard Shmoys
Description
Designed as a textbook for graduate courses on algorithms, this book presents efficient algorithms that find provably near-optimal solutions.
Get the book
Other editions
Similar books
-
Approximation Algorithms
By Vijay V. VaziraniThis book covers the dominant theoretical approaches to the approximate solution of hard combinatorial optimization and enumeration problems.
-
Design and Analysis of Approximation Algorithms
By Ding-Zhu Du, Ker-I Ko, Xiaodong HuThis book is intended to be used as a textbook for graduate students studying theoretical computer science. It can also be used as a reference book for researchers in the area of design and analysis of approximation algorithms.
-
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
By Giorgio Ausiello, Pierluigi Crescenzi, Giorgio GambosiLet G = (V, E) be a complete weighted graph satisfying the triangular inequality and let M = (V, ... the hypothesis of the previous lemma, (3) compute an Eulerian walk w on M, and (4) extract from w a tour according to the proof of ...
-
Geometric Approximation Algorithms
By Sariel Har-PeledThese algorithms tend to be simple, fast, and more robust than their exact counterparts. This book is the first to cover geometric approximation algorithms in detail.
-
Approximation and Optimization: Algorithms, Complexity and Applications
By Panos M. Pardalos, Ioannis C. DemetriouThis book focuses on the development of approximation-related algorithms and their relevant applications.
-
Approximation Algorithms for NP-hard Problems
By Dorit S. HochbaumThis is the first book to fully address the study of approximation algorithms as a tool for coping with intractable problems. With chapters contributed by leading researchers in the field,...
-
Handbook of Approximation Algorithms and Metaheuristics: Methologies and Traditional Applications
By Teofilo F. GonzalezThrough contributions from leading experts, this handbook provides a comprehensive introduction to the underlying theory and methodologies, as well as the various applications of approximation algorithms and metaheuristics.
-
Design and Analysis of Algorithms: A Contemporary Perspective
By Amit Kumar, Sandeep SenFocuses on the interplay between algorithm design and the underlying computational models.
-
Approximation and Online Algorithms: 17th International Workshop, WAOA 2019, Munich, Germany, September 12–13, 2019, Revised Selected Papers
By Nicole Megow, Evripidis BampisThis book constitutes the thoroughly refereed workshop post-proceedings of the 17th International Workshop on Approximation and Online Algorithms, WAOA 2019, held in Munich, Germany, in September 2019 as part of ALGO 2019.
-
Randomized Algorithms
By Prabhakar Raghavan, Rajeev MotwaniThe function 6 is the transition function of the Turing machine, mapping S x I to (S U {HALT,YES,NO}) xl x {