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

  • Prasad Raghavendra
  • Sofya Raskhodnikova
  • Klaus Jansen
  • José D. P. Rolim

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

Table of contents

  1. Front Matter
  2. APPROX

    1. Kook Jin Ahn, Sudipto Guha, Andrew McGregor
      Pages 1-10
    2. Saeed Alaei, MohammadTaghi Hajiaghayi, Vahid Liaghat
      Pages 11-25
    3. Per Austrin, Rajsekar Manokaran, Cenny Wenner
      Pages 26-41
    4. Vladimir Braverman, Rafail Ostrovsky
      Pages 42-57
    5. Deeparnab Chakrabarty, Ravishankar Krishnaswamy, Shi Li, Srivatsan Narayanan
      Pages 71-80
    6. Edith Cohen, Haim Kaplan, Yishay Mansour
      Pages 81-95
    7. Adrian Dumitrescu, Csaba D. Tóth
      Pages 96-109
    8. Katherine Edwards, Simon Griffiths, William Sean Kennedy
      Pages 110-125
    9. Sándor P. Fekete, Hella-Franziska Hoffmann
      Pages 126-141
    10. Kyle Fox, Sungjin Im, Janardhan Kulkarni, Benjamin Moseley
      Pages 142-157
    11. Pierre Fraigniaud, Magnús M. Halldórsson, Boaz Patt-Shamir, Dror Rawitz, Adi Rosén
      Pages 158-172
    12. Zachary Friggstad
      Pages 173-188
    13. Anupam Gupta, Satyen Kale, Viswanath Nagarajan, Rishi Saket, Baruch Schieber
      Pages 205-217
    14. MohammadTaghi Hajiaghayi, Rohit Khandekar, M. Reza Khani, Guy Kortsarz
      Pages 218-232
    15. Yury Makarychev, Amir Nayyeri, Anastasios Sidiropoulos
      Pages 244-259
    16. Yishay Mansour, Shai Vardi
      Pages 260-273

About these proceedings

Introduction

This book constitutes the proceedings of the 16th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2013, and the 17th International Workshop on Randomization and Computation, RANDOM 2013, held in August 2013 in the USA. The total of 48 carefully reviewed and selected papers presented in this volume consist of 23 APPROX papers selected out of 46 submissions, and 25 RANDOM papers selected out of 52 submissions. APPROX 2013 focuses on algorithmic and complexity theoretic issues relevant to the development of efficient approximate solutions to computationally difficult problems, while RANDOM 2013 focuses on applications of randomness to computational and combinatorial problems.

Keywords

approximation algorithms data streams linear programming recursion traveling salesman

Editors and affiliations

  • Prasad Raghavendra
    • 1
  • Sofya Raskhodnikova
    • 2
  • Klaus Jansen
    • 3
  • José D. P. Rolim
    • 4
  1. 1.University of CaliforniaBerkeleyUSA
  2. 2.Dept. of computer Science and EngineeringPennsylvania State UniversityUniversity ParkUSA
  3. 3.Institute of Computer ScienceUniversity of KielKielGermany
  4. 4.University of Geneva, Centre Universitaire d’InformatiqueCarougeSwitzerland

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-642-40328-6
  • Copyright Information Springer-Verlag Berlin Heidelberg 2013
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-40327-9
  • Online ISBN 978-3-642-40328-6
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book