Combinatorial Optimization: Theory and Algorithms

✍ Scribed by Bernhard Korte, Jens Vygen (auth.)

Publisher: Springer-Verlag Berlin Heidelberg
Year: 2012
Tongue: English
Leaves: 679
Series: Algorithms and Combinatorics 21
Edition: 5
Category: Library

No coin nor oath required. For personal study only.

✦ Synopsis

This comprehensive textbook on combinatorial optimization places special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It is based on numerous courses on combinatorial optimization and specialized topics, mostly at graduate level. This book reviews the fundamentals, covers the classical topics (paths, flows, matching, matroids, NP-completeness, approximation algorithms) in detail, and proceeds to advanced and recent topics, some of which have not appeared in a textbook before. Throughout, it contains complete but concise proofs, and also provides numerous exercises and references.

This fifth edition has again been updated, revised, and significantly extended, with more than 60 new exercises and new material on various topics, including Cayley's formula, blocking flows, faster b-matching separation, multidimensional knapsack, multicommodity max-flow min-cut ratio, and sparsest cut. Thus, this book represents the state of the art of combinatorial optimization.

✦ Table of Contents

Front Matter....Pages I-XIX
Introduction....Pages 1-12
Graphs....Pages 13-49
Linear Programming....Pages 51-71
Linear Programming Algorithms....Pages 73-99
Integer Programming....Pages 101-129
Spanning Trees and Arborescences....Pages 131-155
Shortest Paths....Pages 157-171
Network Flows....Pages 173-209
Minimum Cost Flows....Pages 211-239
Maximum Matchings....Pages 241-271
Weighted Matching....Pages 273-299
b -Matchings and T -Joins....Pages 301-320
Matroids....Pages 321-353
Generalizations of Matroids....Pages 355-375
NP -Completeness....Pages 377-412
Approximation Algorithms....Pages 413-457
The Knapsack Problem....Pages 459-470
Bin-Packing....Pages 471-488
Multicommodity Flows and Edge-Disjoint Paths....Pages 489-520
Network Design Problems....Pages 521-556
The Traveling Salesman Problem....Pages 557-592
Facility Location....Pages 593-628
Back Matter....Pages 629-659

✦ Subjects

Combinatorics; Calculus of Variations and Optimal Control; Optimization; Mathematics of Computing; Operations Research/Decision Theory

📜 SIMILAR VOLUMES

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

Combinatorial Optimization: Theory and A

📁 Combinatorial Optimization: Theory and Algorithms

✍ Bernhard Korte, Jens Vygen (auth.) 📂 Library 📅 2008 🏛 Springer Berlin Heidelberg 🌐 English

<P>Now fully updated in a third edition, this is a comprehensive textbook on combinatorial optimization. It puts special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. The book contains complete but concise proofs, also for many deep results

Combinatorial optimization: theory and a

📁 Combinatorial optimization: theory and algorithms

✍ Bernhard H. Korte, Jens Vygen 📂 Library 📅 2002 🏛 Springer 🌐 English

This comprehensive textbook on combinatorial optimization puts special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics.It has arisen as the basis of several courses on combinatorial optimization and more special topics at graduate level. Since

Combinatorial Optimization: Theory and A

📁 Combinatorial Optimization: Theory and Algorithms

✍ Bernhard Korte, Jens Vygen (auth.) 📂 Library 📅 2012 🏛 Springer-Verlag Berlin Heidelberg 🌐 English

<p><p>This comprehensive textbook on combinatorial optimization places special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It is based on numerous courses on combinatorial optimization and specialized topics, mostly at graduate level. Thi