Cuts and metrics are well-known objects that arise - independently, but with many deep and fascinating connections in diverse fields: in graph theory, combinatorial optimization, geometry of numbers, combinatorial matrix theory, statistical physics, VLSI design etc. This book offers a comprehensive summary together with a global view, establishing both old and new links. Its treatment ranges from classical theorems of Menger and Schoenberg to recent developments such as approximation results for multicommodity flow and max-cut problems, metric aspects of Delaunay polytopes, isometric graph embeddings, and matrix completion problems. The discussion leads to many interesting subjects that cannot be found elsewhere, providing a unique and invaluable source for researchers and graduate students.

Скачать книгу бесплатно (pdf, 2.50 Mb)

---

Читать «Geometry of cuts and metrics»