๐”– Scriptorium
โœฆ   LIBER   โœฆ
๐Ÿ“

Geometric Algorithms and Combinatorial Optimization, Second Edition (Algorithms and Combinatorics)

โœ Scribed by Martin Grรถtschel, Laszlo Lovasz, Alexander Schrijver

Publisher
Springer
Year
1993
Tongue
English
Leaves
379
Series
Algorithms and Combinatorics
Edition
Second
Category
Library
โฌ‡  Acquire This Volume

No coin nor oath required. For personal study only.

โœฆ Synopsis

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 point in a convex set and the basis reduction method for point lattices. This book is a continuation and extension of previous research of the authors for which they received the Fulkerson prize, awarded by the Mathematical Programming Society and the American Mathematical Society. The first edition of this book was received enthusiastically by the community of discrete mathematicians, combinatorial optimizers, operations researchers, and computer scientists. To quote just from a few reviews: "The book is written in a very grasping way, legible both for people who are interested in the most important results and for people who are interested in technical details and proofs." #manuscripta geodaetica#1

๐Ÿ“œ 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

Combinatorial Optimization: Theory and A
๐Ÿ“ Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics)
โœ Bernhard Korte, Jens Vygen ๐Ÿ“‚ Library ๐Ÿ“… 2005 ๐Ÿ› Springer ๐ŸŒ English

This is the most comprehensive compilation on combinatorial optiomization I have seen so far. Usually, Papadimitriou's book is a good place for this material - but in many cases, looking for proofs and theorems - I had to use several books: (*) Combinatorial Optimization Algorithms and Complexity by

Combinatorial Optimization: Theory and A
๐Ÿ“ Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics)
โœ Bernhard Korte ๐Ÿ“‚ Library ๐Ÿ“… 2012 ๐Ÿ› Springer ๐ŸŒ English

<span>This comprehensive textbook on combinatorial optimization places specialemphasis on theoretical results and algorithms with provably goodperformance, in contrast to heuristics. It is based on numerous courses on combinatorial optimization and specialized topics, mostly at graduate level. This

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