Geometric Algorithms and Combinatorial Optimization - Martin Grötschel,Alexander Schrijver,Laszlo Lovasz
-30% ar kodu BOOKS
Piegāde 12-18 darba dienu laikā
30 dienu atgriešanas politika
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 f ... Pilns apraksts
Jums varētu patikt arī
TOP
The Demon-Haunted World: Science as a Candle in the Dark
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Heart Rate Variability: Science and Strategies for Peak Performance
Marco Altini, Sylvain Laborde, Dan Plews, Emma Mosley
-30% ar kodu BOOKS
Nav noliktavā
TOP
Many Faces, One Purpose: A Managers Handbook on Women in Firefighting
U. S. Fire Administration, Homeland Security
-30% ar kodu BOOKS
Nav noliktavā
TOP
The Gulf Moment: Arab Relations Since 2011
Florence Gaub, U. S. Army War College, Strategic Studies Institute
-30% ar kodu BOOKS
Nav noliktavā
TOP
Introduction to Algorithms
Ronald L. Rivest, Charles E. Leiserson, Clifford Stein, Thomas H. Cormen
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Thinking in Systems: International Bestseller
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Integrating Special Forces and the ATLAS Network: A Theoretical Framework for Strategic Security Cooperation in Europe
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
The Code Book: The Science of Secrecy from Ancient Egypt to Quantum Cryptography
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
101 Things I Learned in Architecture School
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Skin in the Game: Hidden Asymmetries in Daily Life
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Dinosaurs and Prehistoric Life: The Definitive Visual Guide to Prehistoric Animals
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
International Economics: Theory and Policy, Global Edition
Paul Krugman, Maurice Obstfeld, Marc Melitz
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
The Unaccountability Machine: Why Big Systems Make Terrible Decisions
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Nudge: Improving Decisions About Health, Wealth and Happiness
Cass R Sunstein, Richard H. Thaler
-30% ar kodu BOOKS
Noliktavā
TOP
Crossing Borders: About the birth of the Consortium of European Research Libraries, the organisation's early years and its path to maturity, spanning the period from the late twentieth century to the first decades of the twenty-first century
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Cybernetics: Second Edition: Or the Control and Communication in the Animal and the Machine
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Only Dull People Are Brilliant at Breakfast
-30% ar kodu BOOKS
Piegādātāja noliktavā
Aprašymas
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.
Vairāk informācijas
| Autors | Martin Grötschel, Alexander Schrijver, Laszlo Lovasz |
|---|---|
| Izdevējs | Springer Berlin Heidelberg |
| Series | Algorithms and Combinatorics |
| Izlaides gads | 2011 |
| Vāka tips | Mīkstais vāks |
| EAN | 9783642782428 |