Combinatorial optimization: networks and matroids

✍ Scribed by Eugene L. Lawler

Publisher: Oxford University Press, USA
Year: 1995
Tongue: English
Leaves: 384
Category: Library

No coin nor oath required. For personal study only.

✦ Synopsis

Perceptively written text examines optimization problems that can be formulated in terms of networks and algebraic structures called matroids. Chapters cover shortest paths, network flows, bipartite matching, nonbipartite matching, matroids and the greedy algorithm, matroid intersections, and the matroid parity problems. A suitable text or reference for courses in combinatorial computing and concrete computational complexity in departments of computer science and mathematics.

📜 SIMILAR VOLUMES

Combinatorial Optimization: Networks and

📁 Combinatorial Optimization: Networks and Matroids

✍ Eugene L. Lawler 📂 Library 📅 1995 🏛 Oxford University Press, USA 🌐 English

Combinatorial optimization: networks and

📁 Combinatorial optimization: networks and matroids

✍ Lawler E.L. 📂 Library 📅 1995 🏛 Oxford University Press, USA 🌐 English

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, Jens Vygen 📂 Library 📅 2002 🏛 Springer 🌐 English

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