Book 2015

Gems of Combinatorial Optimization and Graph Algorithms

ISBN: 978-3-319-24970-4 (Print) 978-3-319-24971-1 (Online)

Table of contents (14 chapters)

  1. Front Matter

    Pages i-x

  2. No Access

    Chapter

    Pages 1-12

    Shifting Segments to Optimality

  3. No Access

    Chapter

    Pages 13-27

    Linear Structure of Graphs and the Knotting Graph

  4. No Access

    Chapter

    Pages 29-36

    Finding Longest Geometric Tours

  5. No Access

    Chapter

    Pages 37-47

    Generalized Hanan Grids for Geometric Steiner Trees in Uniform Orientation Metrics

  6. No Access

    Chapter

    Pages 49-57

    Budgeted Matching via the Gasoline Puzzle

  7. No Access

    Chapter

    Pages 59-68

    Motifs in Networks

  8. No Access

    Chapter

    Pages 69-82

    Graph Fill-In, Elimination Ordering, Nested Dissection and Contraction Hierarchies

  9. No Access

    Chapter

    Pages 83-94

    Shortest Path to Mechanism Design

  10. No Access

    Chapter

    Pages 95-102

    Selfish Routing and Proportional Resource Allocation

  11. No Access

    Chapter

    Pages 103-111

    Resource Buying Games

  12. No Access

    Chapter

    Pages 113-123

    Linear, Exponential, but Nothing Else

  13. No Access

    Chapter

    Pages 125-132

    Convex Quadratic Programming in Scheduling

  14. No Access

    Chapter

    Pages 133-141

    Robustness and Approximation for Universal Sequencing

  15. No Access

    Chapter

    Pages 143-150

    A Short Note on Long Waiting Lists