Combinatorial Optimization: Theory and Algorithms

Front Cover
Springer, Jan 1, 2000 - Combinatorial optimization - 530 pages
0 Reviews
This comprehensive textbook on combinatorial optimisation 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 optimisation and more special topics at graduate level. Since the complete book contains enough material for at least four semesters (4 hours a week), one usually selects material in a suitable way. The book contains complete (but concise) proofs, also for many deep results, some of which did not appear in a book before. Many very recent topics are covered as well, and many references are provided. Thus this book represents the state-of-the-art of combinatorial optimisation.

From inside the book

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

Introduction
1
Graphs
13
Linear Programming
49
Copyright

20 other sections not shown

Other editions - View all

Common terms and phrases

About the author (2000)

Korte, University of Bonn, Germany.

Vygen, University of Bonn, Germany.

Bibliographic information