𝔖 Scriptorium
✦   LIBER   ✦
📁

Geometric Algorithms and Combinatorial Optimization

✍ Scribed by Martin Grötschel, László Lovász, Alexander Schrijver (auth.)

Publisher
Springer Berlin Heidelberg
Year
1988
Tongue
English
Leaves
373
Series
Algorithms and Combinatorics 2
Category
Library
⬇  Acquire This Volume

No coin nor oath required. For personal study only.

✦ Table of Contents

Front Matter....Pages I-XII
Mathematical Preliminaries....Pages 1-20
Complexity, Oracles, and Numerical Computation....Pages 21-45
Algorithmic Aspects of Convex Sets: Formulation of the Problems....Pages 46-63
The Ellipsoid Method....Pages 64-101
Algorithms for Convex Bodies....Pages 102-132
Diophantine Approximation and Basis Reduction....Pages 133-156
Rational Polyhedra....Pages 157-196
Combinatorial Optimization: Some Basic Examples....Pages 197-224
Combinatorial Optimization: A Tour d’Horizon....Pages 225-271
Stable Sets in Graphs....Pages 272-303
Submodular Functions....Pages 304-329
Back Matter....Pages 331-364

✦ Subjects

Combinatorics

📜 SIMILAR VOLUMES

Geometric Algorithms and Combinatorial O
📁 Geometric Algorithms and Combinatorial Optimization, Second Edition (Algorithms and Combinatorics)
✍ Martin Grötschel, Laszlo Lovasz, Alexander Schrijver 📂 Library 📅 1993 🏛 Springer 🌐 English

This book develops geometric techniques for proving the polynomial time solvability of problems in convexity theory, geometry, and, in particular, combinatorial optimization. It offers a unifying approach which is based on two fundamental geometric algorithms: the ellipsoid method for finding a poin

Geometric Algorithms and Combinatorial O
📁 Geometric Algorithms and Combinatorial Optimization, Second Edition (Algorithms and Combinatorics)
✍ Martin Grötschel, Laszlo Lovasz, Alexander Schrijver 📂 Library 📅 1993 🏛 Springer 🌐 English

This book develops geometric techniques for proving the polynomial time solvability of problems in convexity theory, geometry, and, in particular, combinatorial optimization. It offers a unifying approach which is based on two fundamental geometric algorithms: the ellipsoid method for finding a poin

Geometric Algorithms and Combinatorial O
📁 Geometric Algorithms and Combinatorial Optimization
✍ Martin Grötschel, László Lovász, Alexander Schrijver (auth.) 📂 Library 📅 1993 🏛 Springer-Verlag Berlin Heidelberg 🌐 English

<p>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