Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006 and 10th International Workshop on Randomization and Computation, RANDOM 2006, Barcelona, Spain, August 28-30 2006. Proceedings

Editors:

ISBN: 978-3-540-38044-3 (Print) 978-3-540-38045-0 (Online)

Table of contents (46 chapters)

previous Page of 3
  1. Front Matter

    Pages -

  2. Invited Talks

    1. No Access

      Book Chapter

      Pages 1-1

      On Nontrivial Approximation of CSPs

    2. No Access

      Book Chapter

      Pages 2-2

      Analysis of Algorithms on the Cores of Random Graphs

  3. Contributed Talks of APPROX

    1. No Access

      Book Chapter

      Pages 3-14

      Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs

    2. No Access

      Book Chapter

      Pages 15-26

      Approximating Precedence-Constrained Single Machine Scheduling by Coloring

    3. No Access

      Book Chapter

      Pages 27-38

      Minimizing Setup and Beam-On Times in Radiation Therapy

    4. No Access

      Book Chapter

      Pages 39-48

      On the Value of Preemption in Scheduling

    5. No Access

      Book Chapter

      Pages 49-60

      An Improved Analysis for a Greedy Remote-Clique Algorithm Using Factor-Revealing LPs

    6. No Access

      Book Chapter

      Pages 61-69

      Tight Results on Minimum Entropy Set Cover

    7. No Access

      Book Chapter

      Pages 70-81

      A Tight Lower Bound for the Steiner Point Removal Problem on Trees

    8. No Access

      Book Chapter

      Pages 82-94

      Single-Source Stochastic Routing

    9. No Access

      Book Chapter

      Pages 95-103

      An O(logn) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem

    10. No Access

      Book Chapter

      Pages 104-115

      Online Algorithms to Minimize Resource Reallocations and Network Communication

    11. No Access

      Book Chapter

      Pages 116-127

      Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs

    12. No Access

      Book Chapter

      Pages 128-139

      Combinatorial Algorithms for Data Migration to Minimize Average Completion Time

    13. No Access

      Book Chapter

      Pages 140-151

      LP Rounding and an Almost Harmonic Algorithm for Scheduling with Resource Dependent Processing Times

    14. No Access

      Book Chapter

      Pages 152-163

      Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees

    15. No Access

      Book Chapter

      Pages 164-175

      Improved Algorithms for Data Migration

    16. No Access

      Book Chapter

      Pages 176-187

      Approximation Algorithms for Graph Homomorphism Problems

    17. No Access

      Book Chapter

      Pages 188-199

      Improved Approximation Algorithm for the One-Warehouse Multi-Retailer Problem

    18. No Access

      Book Chapter

      Pages 200-211

      Hardness of Preemptive Finite Capacity Dial-a-Ride

previous Page of 3