دانلود کتاب Gems of Combinatorial Optimization and Graph Algorithms

فهرست مطالب :

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