DISCLOSURE:
When you click on links to various merchants on this site and make a purchase, this can result in this site earning a commission at no extra cost to you. Affiliate programs and affiliations include, but are not limited to, the eBay Partner Network, Amazon and Alibris.
I can't believe that God put us on this earth to be ordinary.
ISBN10: 3642782426, ISBN13: 9783642782428, [publisher: Springer Berlin Heidelberg] Softcover 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 giv ...
New. New Book; Fast Shipping from UK; Not signed; Not First Edition; The Geometric Algorithms and Combinatorial Optimization. ISBN 3642782426 9783642782428 [GB]
ISBN10: 3642782426, ISBN13: 9783642782428, [publisher: Springer Berlin Heidelberg] Softcover 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 giv ...
Grotschel, Martin; Lovasz, Laszlo; Schrijver, Alexander
USD
260.99
Kennys Bookstore /Abebooks
ISBN10: 3642782426, ISBN13: 9783642782428, [publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG] Softcover Series: Algorithms and Combinatorics. Num Pages: 374 pages, biography. BIC Classification: GPFC; KCA; PBKQ; PBV. Category: (P) Professional & Vocational. Dimension: 242 x 170 x 20. Weight in Grams: 648. . 2011. 2nd ed. 1993. Softcover reprint of the original 2. Paperback. . . . . Books ship from the US and Ireland. [Olney, MD, U.S.A.] [Publication Year: 2011]
DISCLOSURE:
When you click on links to various merchants on this site and make a purchase, this can result in this site earning a commission at no extra cost to you. Affiliate programs and affiliations include, but are not limited to, the eBay Partner Network, Amazon and Alibris.
