Combinatorial Optimization: Theory and Algorithms
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.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Other editions - View all
Algorithm Input approximation algorithm approximation scheme arborescence augmenting path bipartite graph blossom bound capacities cardinality clauses combinatorial optimization Computer connected components consider contains Corollary decision problem define Definition digraph digraph G e e E(G ear-decomposition Edmonds Eulerian Exercise exists finite Flow Problem given graph G greedoid Hamiltonian circuit implies incidence vectors independence system induction inequality integral vector iteration Journal Lemma Let G Linear Programming Lovasz Mathematics matrix matroid maximal maximum minimal Minimum Cost Flow nonnegative optimization problems optimum solution oracle outer perfect matching planar graph polyhedron Polymatroid polynomial polynomial-time algorithm polytope Proof Proposition prove reachable resp running satisfies Schrijver Section shortest path Shortest Path Problem solved spanning tree stable set strongly connected components subgraph subset T-join Theorem tour Turing machine undirected graph v e V(G variables vertex cover vertices