Synopsis
This book develops geometric techniques for proving the polynomial time solvability of problems in convexity theory, geometry, and, in particular, combinatorial optimization. The book is a continuation and extension of previous research of the authors for which they received the Fulkerson prize, awarded by the Mathematical Programming Society and the American Mathematical Society. To quote from a review: "This book ... is doubtless one of the outstanding books in discrete mathematics at all." (Journal of Information Proceedings and Cybernetics).
"synopsis" may belong to another edition of this title.
Other Popular Editions of the Same Title
Search results for Geometric Algorithms and Combinatorial Optimization
Stock Image
Geometric Algorithms and Combinatorial Optimization (Algorithms and Combinatorics)
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # ABLIING23Mar3113020236265
Stock Image
Geometric Algorithms and Combinatorial Optimization (Algorithms and Combinatorics)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. In. Seller Inventory # ria9783642782428_new
Buy New
US$ 160.52
Shipping:
US$ 15.77
From United Kingdom to U.S.A.
Quantity: Over 20 available
Seller Image
Geometric Algorithms and Combinatorial Optimization
Published by
Springer Berlin Heidelberg Dez 2011, 2011
ISBN 10: 3642782426
ISBN 13: 9783642782428
New
Taschenbuch
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 380 pp. Englisch. Seller Inventory # 9783642782428
Seller Image
Geometric Algorithms and Combinatorial Optimization
Published by
Springer Berlin Heidelberg, 2011
ISBN 10: 3642782426
ISBN 13: 9783642782428
New
Softcover
Seller: moluna, Greven, Germany
Seller rating 4 out of 5 stars
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 see. Seller Inventory # 5070508
Buy New
US$ 151.81
Shipping:
US$ 56.68
From Germany to U.S.A.
Quantity: Over 20 available
Stock Image
Geometric Algorithms and Combinatorial Optimization
Seller: Books Puddle, New York, NY, U.S.A.
Seller rating 4 out of 5 stars
Condition: New. pp. xii + 362 2nd Edition. Seller Inventory # 2654507731
Seller Image
Geometric Algorithms and Combinatorial Optimization
Seller: preigu, Osnabrück, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. Geometric Algorithms and Combinatorial Optimization | Martin Grötschel (u. a.) | Taschenbuch | XII | Englisch | 2011 | Springer | EAN 9783642782428 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. Seller Inventory # 106366849
Seller Image
Geometric Algorithms and Combinatorial Optimization
Published by
Springer Berlin Heidelberg, Springer Berlin Heidelberg Dez 2011, 2011
ISBN 10: 3642782426
ISBN 13: 9783642782428
New
Taschenbuch
First Edition
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. Neuware -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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 380 pp. Englisch. Seller Inventory # 9783642782428
Stock Image
Geometric Algorithms and Combinatorial Optimization
Print on DemandSeller: Majestic Books, Hounslow, United Kingdom
Seller rating 4 out of 5 stars
Condition: New. Print on Demand pp. xii + 362 23 Figures. Seller Inventory # 55052044
Buy New
US$ 242.65
Shipping:
US$ 8.55
From United Kingdom to U.S.A.
Quantity: 4 available
Seller Image
Geometric Algorithms and Combinatorial Optimization
Published by
Springer Berlin Heidelberg, 2011
ISBN 10: 3642782426
ISBN 13: 9783642782428
New
Taschenbuch
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. Seller Inventory # 9783642782428
Stock Image
Geometric Algorithms and Combinatorial Optimization
Print on DemandSeller: Biblios, Frankfurt am main, HESSE, Germany
Seller rating 4 out of 5 stars
Condition: New. PRINT ON DEMAND pp. xii + 362. Seller Inventory # 1854507737