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

  • Editors
  • Ashish Goel
  • Klaus Jansen
  • José D. P. Rolim
  • Ronitt Rubinfeld
Conference proceedings

DOI: 10.1007/978-3-540-85363-3

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5171)

Table of contents (47 papers)

  1. Front Matter
  2. Contributed Talks of APPROX

    1. Approximating Optimal Binary Decision Trees
      Micah Adler, Brent Heeringa
      Pages 1-9
    2. Santa Claus Meets Hypergraph Matchings
      Arash Asadpour, Uriel Feige, Amin Saberi
      Pages 10-20
    3. Ordinal Embedding: Approximation Algorithms and Dimensionality Reduction
      Mihai Bădoiu, Erik D. Demaine, MohammadTaghi Hajiaghayi, Anastasios Sidiropoulos, Morteza Zadimoghaddam
      Pages 21-34
    4. Connected Vertex Covers in Dense Graphs
      Jean Cardinal, Eythan Levy
      Pages 35-48
    5. Sweeping Points
      Adrian Dumitrescu, Minghui Jiang
      Pages 63-76
    6. Approximating Maximum Subgraphs without Short Cycles
      Guy Kortsarz, Michael Langberg, Zeev Nutov
      Pages 118-131
    7. Deterministic 7/8-Approximation for the Metric Maximum TSP
      Łukasz Kowalik, Marcin Mucha
      Pages 132-145
    8. Inapproximability of Survivable Networks
      Yuval Lando, Zeev Nutov
      Pages 146-152
    9. Approximating Single Machine Scheduling with Scenarios
      Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svensson
      Pages 153-164
    10. Streaming Algorithms for k-Center Clustering with Outliers and with Anonymity
      Richard Matthew McCutchen, Samir Khuller
      Pages 165-178
    11. The Directed Minimum Latency Problem
      Viswanath Nagarajan, R. Ravi
      Pages 193-206

About these proceedings

Introduction

This book constitutes the joint refereed proceedings of the 11th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2008 and the 12th International Workshop on Randomization and Computation, RANDOM 2008, held in Boston, MA, USA, in August 2008.

The 20 revised full papers of the APPROX 2008 workshop were carefully reviewed and selected from 42 submissions and focus on algorithmic and complexity issues surrounding the development of efficient approximate solutions to computationally difficult problems. RANDOM 2008 is concerned with applications of randomness to computational and combinatorial problems and accounts for 27 revised full papers, also diligently reviewed and selected out of 52 workshop submissions.

Keywords

algorithms anonymity approximation approximation algorithms black-box reductions clustering coding combinatorial optimization combinatorics complexity computational complexity computational geometry dense graph derandomization dimension reduction

Bibliographic information

  • Copyright Information Springer-Verlag Berlin Heidelberg 2008
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-540-85362-6
  • Online ISBN 978-3-540-85363-3
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349