| 书目名称 | Geometric Algorithms and Combinatorial Optimization | | 编辑 | Martin Grötschel,László Lovász,Alexander Schrijver | | 视频video | | | 丛书名称 | Algorithms and Combinatorics | | 图书封面 |  | | 描述 | 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 su | | 出版日期 | Book 1993Latest edition | | 关键词 | Basis Reduction in Lattices; Basisreduktion bei Gittern; Convexity; Ellipsoid Method; Ellipsoidmethode; K | | 版次 | 2 | | doi | https://doi.org/10.1007/978-3-642-78240-4 | | isbn_softcover | 978-3-642-78242-8 | | isbn_ebook | 978-3-642-78240-4Series ISSN 0937-5511 Series E-ISSN 2197-6783 | | issn_series | 0937-5511 | | copyright | Springer-Verlag Berlin Heidelberg 1993 |
The information of publication is updating
|
|
发表于 2025-3-21 18:28:50
