Access this book
Tax calculation will be finalised at checkout
Other ways to access
About this book
Since the publication of the first edition of our book, geometric algorithms and combinatorial optimization have kept growing at the same fast pace as before. Nevertheless, we do not feel that the ongoing research has made this book outdated. Rather, it seems that many of the new results build on the models, algorithms, and theorems presented here. For instance, the celebrated Dyer-Frieze-Kannan algorithm for approximating the volume of a convex body is based on the oracle model of convex bodies and uses the ellipsoid method as a preprocessing technique. The polynomial time equivalence of optimization, separation, and membership has become a commonly employed tool in the study of the complexity of combinatorial optimization problems and in the newly developing field of computational convexity. Implementations of the basis reduction algorithm can be found in various computer algebra software systems. On the other hand, several of the open problems discussed in the first edition are still unsolved. For example, there are still no combinatorial polynomial time algorithms known for minimizing a submodular function or finding a maximum clique in a perfect graph. 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. In particular, it is not known how to adapt interior point methods to such linear programs.
Similar content being viewed by others
Table of contents (11 chapters)
-
Front Matter
-
Back Matter
Authors and Affiliations
Accessibility Information
PDF accessibility summary
This PDF is not accessible. It is based on scanned pages and does not support features such as screen reader compatibility or described non-text content (images, graphs etc). However, it likely supports searchable and selectable text based on OCR (Optical Character Recognition). Users with accessibility needs may not be able to use this content effectively. Please contact us at accessibilitysupport@springernature.com if you require assistance or an alternative format.
Bibliographic Information
Book Title: Geometric Algorithms and Combinatorial Optimization
Authors: Martin Grötschel, László Lovász, Alexander Schrijver
Series Title: Algorithms and Combinatorics
DOI: https://doi.org/10.1007/978-3-642-78240-4
Publisher: Springer Berlin, Heidelberg
-
eBook Packages: Springer Book Archive
Copyright Information: Springer-Verlag Berlin Heidelberg 1993
Softcover ISBN: 978-3-642-78242-8Published: 21 December 2011
eBook ISBN: 978-3-642-78240-4Published: 06 December 2012
Series ISSN: 0937-5511
Series E-ISSN: 2197-6783
Edition Number: 2
Number of Pages: XII, 362
Topics: Combinatorics, Systems Theory, Control, Calculus of Variations and Optimal Control; Optimization, Economic Theory/Quantitative Economics/Mathematical Methods