Approximation and Online Algorithms

10th International Workshop, WAOA 2012, Ljubljana, Slovenia, September 13-14, 2012, Revised Selected Papers

Editors:

ISBN: 978-3-642-38015-0 (Print) 978-3-642-38016-7 (Online)

Table of contents (23 chapters)

previous Page of 2
  1. Front Matter

    Pages -

  2. Invited Contribution

    1. No Access

      Book Chapter

      Pages 1-1

      The Primal-Dual Approach for Online Algorithms

  3. Session 1: Graphs and Networks

    1. No Access

      Book Chapter

      Pages 2-15

      Independent Set with Advice: The Impact of Graph Knowledge

    2. No Access

      Book Chapter

      Pages 16-29

      Online Multi-Commodity Flow with High Demands

    3. No Access

      Book Chapter

      Pages 30-41

      Approximating Spanning Trees with Few Branches

    4. No Access

      Book Chapter

      Pages 42-55

      On the Complexity of the Regenerator Location Problem - Treewidth and Other Parameters

  4. Session 2: Geometric Problems

    1. No Access

      Book Chapter

      Pages 56-69

      Online Exploration of Polygons with Holes

    2. No Access

      Book Chapter

      Pages 70-81

      Probabilistic k-Median Clustering in Data Streams

    3. No Access

      Book Chapter

      Pages 82-92

      Linear Time Approximation for Dominating Sets and Independent Dominating Sets in Unit Disk Graphs

    4. No Access

      Book Chapter

      Pages 93-106

      On Minimum-and Maximum-Weight Minimum Spanning Trees with Neighborhoods

  5. Session 3: Online Algorithms

    1. No Access

      Book Chapter

      Pages 107-119

      Asymptotically Optimal Online Page Migration on Three Points

    2. No Access

      Book Chapter

      Pages 120-130

      R–LINE: A Better Randomized 2-Server Algorithm on the Line

    3. No Access

      Book Chapter

      Pages 131-144

      Black and White Bin Packing

    4. No Access

      Book Chapter

      Pages 145-158

      Minimizing Cache Usage in Paging

  6. Session 4: Scheduling

    1. No Access

      Book Chapter

      Pages 159-172

      Competitive-Ratio Approximation Schemes for Makespan Scheduling Problems

    2. No Access

      Book Chapter

      Pages 173-186

      Online Primal-Dual for Non-linear Optimization with Applications to Speed Scaling

    3. No Access

      Book Chapter

      Pages 187-200

      Approximating the Throughput by Coolest First Scheduling

    4. No Access

      Book Chapter

      Pages 201-214

      Algorithms for Cost-Aware Scheduling

  7. Session 5: Algorithmic Game Theory

    1. No Access

      Book Chapter

      Pages 215-228

      A Unifying Tool for Bounding the Quality of Non-cooperative Solutions in Weighted Congestion Games

    2. No Access

      Book Chapter

      Pages 229-241

      Some Anomalies of Farsighted Strategic Behavior

  8. Session 6: Approximation Algorithms

    1. No Access

      Book Chapter

      Pages 242-256

      Scheduling with an Orthogonal Resource Constraint

previous Page of 2