Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

14th International Workshop, APPROX 2011, and 15th International Workshop, RANDOM 2011, Princeton, NJ, USA, August 17-19, 2011. Proceedings

  • Leslie Ann Goldberg
  • Klaus Jansen
  • R. Ravi
  • José D. P. Rolim

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

Table of contents

  1. Front Matter
  2. Contributed Talks of APPROX

    1. Sanjeev Arora, Rong Ge
      Pages 1-12
    2. Per Austrin, Mark Braverman, Eden Chlamtáč
      Pages 13-25
    3. Khanh Do Ba, Piotr Indyk
      Pages 26-37
    4. Nikhil Bansal, Ravishankar Krishnaswamy, Barna Saha
      Pages 38-49
    5. Yair Bartal, Douglas E. Carroll, Adam Meyerson, Ofer Neiman
      Pages 50-61
    6. Piotr Berman, Erik D. Demaine, Morteza Zadimoghaddam
      Pages 62-74
    7. Anand Bhalgat, Deeparnab Chakrabarty, Sanjeev Khanna
      Pages 75-86
    8. Anand Bhalgat, Deeparnab Chakrabarty, Sanjeev Khanna
      Pages 87-98
    9. Venkatesan T. Chakaravarthy, Amit Kumar, Vinayaka Pandit, Sambuddha Roy, Yogish Sabharwal
      Pages 111-122
    10. Parinya Chalermsook
      Pages 123-134
    11. Michael S. Crouch, Andrew McGregor
      Pages 158-170
    12. Adrian Dumitrescu, Minghui Jiang, János Pach
      Pages 194-205
    13. Sándor P. Fekete, Tom Kamphans, Alexander Kröller, Joseph S. B. Mitchell, Christiane Schmidt
      Pages 206-217
    14. Moran Feldman, Joseph (Seffi) Naor, Roy Schwartz
      Pages 218-229

About these proceedings

Introduction

This book constitutes the joint refereed proceedings of the 14th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2011, and the 15th International Workshop on Randomization and Computation, RANDOM 2011, held in Princeton, New Jersey, USA, in August 2011.
The volume presents 29 revised full papers of the APPROX 2011 workshop, selected from 66 submissions, and 29 revised full papers of the RANDOM 2011 workshop, selected from 64 submissions. They were carefully reviewed and selected for inclusion in the book. In addition two abstracts of invited talks are included.
APPROX focuses on algorithmic and complexity issues surrounding the development of efficient approximate solutions to computationally difficult problems. RANDOM is concerned with applications of randomness to computational and combinatorial problems.

Keywords

coding theory computational complexity computational discrete mathematics computational geometry computational graph theory problem complexity random structures

Editors and affiliations

  • Leslie Ann Goldberg
    • 1
  • Klaus Jansen
    • 2
  • R. Ravi
    • 3
  • José D. P. Rolim
    • 4
  1. 1.Department of Computer ScienceUniversity of LiverpoolLiverpoolUK
  2. 2.Department of Computer ScienceUniversity of KielKielGermany
  3. 3.Tepper School of BusinessCarnegie Mellon UniversityPittsburghUSA
  4. 4.Centre Universitaire d’Informatique,University of Geneva,CarougeSwitzerland

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-642-22935-0
  • Copyright Information Springer-Verlag GmbH Berlin Heidelberg 2011
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-22934-3
  • Online ISBN 978-3-642-22935-0
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book
Industry Sectors
Electronics
Telecommunications
Energy, Utilities & Environment
Biotechnology