Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques

11th International Workshop, APPROX 2008, and 12th International Workshop, RANDOM 2008, Boston, MA, USA, August 25-27, 2008. Proceedings

ISBN: 978-3-540-85362-6 (Print) 978-3-540-85363-3 (Online)

Table of contents (47 chapters)

previous Page of 3
  1. Front Matter

    Pages -

  2. Contributed Talks of APPROX

    1. No Access

      Book Chapter

      Pages 1-9

      Approximating Optimal Binary Decision Trees

    2. No Access

      Book Chapter

      Pages 10-20

      Santa Claus Meets Hypergraph Matchings

    3. No Access

      Book Chapter

      Pages 21-34

      Ordinal Embedding: Approximation Algorithms and Dimensionality Reduction

    4. No Access

      Book Chapter

      Pages 35-48

      Connected Vertex Covers in Dense Graphs

    5. No Access

      Book Chapter

      Pages 49-62

      Improved Approximation Guarantees through Higher Levels of SDP Hierarchies

    6. No Access

      Book Chapter

      Pages 63-76

      Sweeping Points

    7. No Access

      Book Chapter

      Pages 77-90

      Constraint Satisfaction over a Non-Boolean Domain: Approximation Algorithms and Unique-Games Hardness

    8. No Access

      Book Chapter

      Pages 91-103

      Fully Polynomial Time Approximation Schemes for Time-Cost Tradeoff Problems in Series-Parallel Project Networks

    9. No Access

      Book Chapter

      Pages 104-117

      Efficient Algorithms for Fixed-Precision Instances of Bin Packing and Euclidean TSP

    10. No Access

      Book Chapter

      Pages 118-131

      Approximating Maximum Subgraphs without Short Cycles

    11. No Access

      Book Chapter

      Pages 132-145

      Deterministic 7/8-Approximation for the Metric Maximum TSP

    12. No Access

      Book Chapter

      Pages 146-152

      Inapproximability of Survivable Networks

    13. No Access

      Book Chapter

      Pages 153-164

      Approximating Single Machine Scheduling with Scenarios

    14. No Access

      Book Chapter

      Pages 165-178

      Streaming Algorithms for k-Center Clustering with Outliers and with Anonymity

    15. No Access

      Book Chapter

      Pages 179-192

      A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined into One

    16. No Access

      Book Chapter

      Pages 193-206

      The Directed Minimum Latency Problem

    17. No Access

      Book Chapter

      Pages 207-218

      A Simple LP Relaxation for the Asymmetric Traveling Salesman Problem

    18. No Access

      Book Chapter

      Pages 219-232

      Approximating Directed Weighted-Degree Constrained Networks

    19. No Access

      Book Chapter

      Pages 233-246

      A Constant Factor Approximation for Minimum λ-Edge-Connected k-Subgraph with Metric Costs

    20. No Access

      Book Chapter

      Pages 247-253

      Budgeted Allocations in the Full-Information Setting

previous Page of 3