Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics)

✍ Scribed by Bernhard Korte

• Publisher: Springer
• Year: 2012
• Tongue: English
• Leaves: 664
• Category: Library

✦ Synopsis

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 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 numerousexercises and references.

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

✦ Table of Contents

Combinatorial Optimization
Preface to the Fifth Edition
Preface to the Fourth Edition
Preface to the Third Edition
Preface to the Second Edition
Preface to the First Edition
Table of Contents
1 Introduction
2 Graphs
3 Linear Programming
4 Linear Programming Algorithms
5 Integer Programming
6 Spanning Trees and Arborescences
7 Shortest Paths
8 Network Flows
9 Minimum Cost Flows
10 Maximum Matchings
11 Weighted Matching
12 b-Matchings and T-Joins
13 Matroids
14 Generalizations of Matroids
15 NP-Completeness
16 Approximation Algorithms
17 The Knapsack Problem
18 Bin-Packing
19 Multicommodity Flows and Edge-Disjoint Paths
20 Network Design Problems
21 The Traveling Salesman Problem
22 Facility Location
Notation Index
Author Index
Subject Index