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
Gems of Combinatorial Optimization and Graph Algorithms
β Scribed by Andreas S. Schulz, Martin Skutella, Sebastian Stiller, Dorothea Wagner (eds.)
- Publisher
- Springer International Publishing
- Year
- 2015
- Tongue
- English
- Leaves
- 153
- Category
- Library
No coin nor oath required. For personal study only.
β¦ Table of Contents
Front Matter....Pages i-x
Shifting Segments to Optimality....Pages 1-12
Linear Structure of Graphs and the Knotting Graph....Pages 13-27
Finding Longest Geometric Tours....Pages 29-36
Generalized Hanan Grids for Geometric Steiner Trees in Uniform Orientation Metrics....Pages 37-47
Budgeted Matching via the Gasoline Puzzle....Pages 49-57
Motifs in Networks....Pages 59-68
Graph Fill-In, Elimination Ordering, Nested Dissection and Contraction Hierarchies....Pages 69-82
Shortest Path to Mechanism Design....Pages 83-94
Selfish Routing and Proportional Resource Allocation....Pages 95-102
Resource Buying Games....Pages 103-111
Linear, Exponential, but Nothing Else....Pages 113-123
Convex Quadratic Programming in Scheduling....Pages 125-132
Robustness and Approximation for Universal Sequencing....Pages 133-141
A Short Note on Long Waiting Lists....Pages 143-150
β¦ Subjects
Operations Research, Management Science; Algorithms; Calculus of Variations and Optimal Control; Optimization; Game Theory, Economics, Social and Behav. Sciences; Convex and Discrete Geometry; Combinatorics
π SIMILAR VOLUMES
<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
The fusion between graph theory and combinatorial optimization has led to theoretically profound and practically useful algorithms, yet there is no book that currently covers both areas together. Handbook of Graph Theory, Combinatorial Optimization, and Algorithms is the first to present a unified,