Book Volume 8096 2013

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

16th International Workshop, APPROX 2013, and 17th International Workshop, RANDOM 2013, Berkeley, CA, USA, August 21-23, 2013. Proceedings

ISBN: 978-3-642-40327-9 (Print) 978-3-642-40328-6 (Online)

Table of contents (48 chapters)

previous Page of 3
  1. Front Matter

    Pages -


    1. Chapter

      Pages 1-10

      Spectral Sparsification in Dynamic Graph Streams

    2. Chapter

      Pages 11-25

      The Online Stochastic Generalized Assignment Problem

    3. Chapter

      Pages 26-41

      On the NP-Hardness of Approximating Ordering Constraint Satisfaction Problems

    4. Chapter

      Pages 42-57

      Approximating Large Frequency Moments with Pick-and-Drop Sampling

    5. Chapter

      Pages 58-70

      Generalizing the Layering Method of Indyk and Woodruff: Recursive Sketches for Frequency-Based Vectors on Streams

    6. Chapter

      Pages 71-80

      Capacitated Network Design on Undirected Graphs

    7. Chapter

      Pages 81-95

      Scheduling Subset Tests: One-Time, Continuous, and How They Relate

    8. Chapter

      Pages 96-109

      On the Total Perimeter of Homothetic Convex Bodies in a Convex Container

    9. Chapter

      Pages 110-125

      Partial Interval Set Cover – Trade-Offs between Scalability and Optimality

    10. Chapter

      Pages 126-141

      Online Square-into-Square Packing

    11. Chapter

      Pages 142-157

      Online Non-clairvoyant Scheduling to Simultaneously Minimize All Convex Functions

    12. Chapter

      Pages 158-172

      Shrinking Maxima, Decreasing Costs: New Online Packing and Covering Problems

    13. Chapter

      Pages 173-188

      Multiple Traveling Salesmen in Asymmetric Metrics

    14. Chapter

      Pages 189-204

      Approximate Indexability and Bandit Problems with Concave Rewards and Delayed Feedback

    15. Chapter

      Pages 205-217

      The Approximability of the Binary Paintshop Problem

    16. Chapter

      Pages 218-232

      Approximation Algorithms for Movement Repairmen

    17. Chapter

      Pages 233-243

      Improved Hardness of Approximating Chromatic Number

    18. Chapter

      Pages 244-259

      A Pseudo-approximation for the Genus of Hamiltonian Graphs

    19. Chapter

      Pages 260-273

      A Local Computation Approximation Scheme to Maximum Matching

    20. Chapter

      Pages 274-286

      Sketching Earth-Mover Distance on Graph Metrics

previous Page of 3