Combinatorial Optimization: Theory and Algorithms

This comprehensive textbook on combinatorial optimization puts special emphasis on theoretical results and algorithms with provably good per formance, in contrast to heuristics. It has arisen as the basis of sev eral courses on combinatorial optimization and more special topics at graduate level. Since the complete book contains enough material for a t least four semesters (4 hours a week), one usually selects material in a suitable way. The book contains complete (but concise) proofs, al so for many deep results, some of which did not appear in a book befor e. Many very recent topics are covered as well, and many references ar e provided. Thus this book represents the state-of-the-art of combinat orial optimization.