Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

15th International Workshop, APPROX 2012, and 16th International Workshop, RANDOM 2012, Cambridge, MA, USA, August 15-17, 2012. Proceedings

  • Anupam Gupta
  • Klaus Jansen
  • José Rolim
  • Rocco Servedio
Conference proceedings APPROX 2012, RANDOM 2012

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

Table of contents

  1. Front Matter
  2. Contributed Talks of APPROX

    1. Per Austrin, Ryan O’Donnell, John Wright
      Pages 1-12
    2. Pranjal Awasthi, Avrim Blum, Jamie Morgenstern, Or Sheffet
      Pages 25-36
    3. Pranjal Awasthi, Or Sheffet
      Pages 37-49
    4. Petros Boufounos, Volkan Cevher, Anna C. Gilbert, Yi Li, Martin J. Strauss
      Pages 61-72
    5. Parinya Chalermsook, Julia Chuzhoy, Sampath Kannan, Sanjeev Khanna
      Pages 73-84
    6. Ho-Leung Chan, Tak-Wah Lam, Rongbin Li
      Pages 85-97
    7. Chandra Chekuri, Alina Ene, Ali Vakilian
      Pages 98-109
    8. Joseph Cheriyan, Zachary Friggstad, Zhihan Gao
      Pages 110-121
    9. Michael Dinitz, Gordon Wilfong
      Pages 122-133
    10. Leah Epstein, Łukasz Jeż, Jiří Sgall, Rob van Stee
      Pages 134-145
    11. Cristina G. Fernandes, Luís A. A. Meira, Flávio K. Miyazawa, Lehilton L. C. Pedrosa
      Pages 146-157
    12. Venkatesan Guruswami, Yuan Zhou
      Pages 158-169
    13. Johan Håstad
      Pages 170-181
    14. Ishay Haviv
      Pages 182-193
    15. Matthias Hellwig, Alexander Souza
      Pages 194-205
    16. Satoru Iwata, Prasad Tetali, Pushkar Tripathi
      Pages 206-217
    17. Samir Khuller, Barna Saha, Kanthi K. Sarpatwar
      Pages 218-230
    18. Christian Konrad, Frédéric Magniez, Claire Mathieu
      Pages 231-242
    19. Michael Lampis
      Pages 243-253
    20. Konstantin Makarychev, Yury Makarychev
      Pages 254-265
    21. Yury Makarychev, Anastasios Sidiropoulos
      Pages 266-275
    22. Rishi Saket, Maxim Sviridenko
      Pages 288-300
  3. Contributed Talks of RANDOM

    1. Anil Ada, Omar Fawzi, Hamed Hatami
      Pages 338-349
    2. Sanjeev Arora, Arnab Bhattacharyya, Rajsekar Manokaran, Sushant Sachdeva
      Pages 362-373
    3. Pranjal Awasthi, Madhav Jha, Marco Molinaro, Sofya Raskhodnikova
      Pages 374-386
    4. Pranjal Awasthi, Madhav Jha, Marco Molinaro, Sofya Raskhodnikova
      Pages 387-398
    5. Petra Berenbrink, Artur Czumaj, Matthias Englert, Tom Friedetzky, Lars Nagel
      Pages 411-422
    6. Aditya Bhaskara, Devendra Desai, Srikanth Srinivasan
      Pages 423-434
    7. Eric Blais, Daniel Kane
      Pages 435-446
    8. Andrej Bogdanov, Periklis A. Papakonstantinou, Andrew Wan
      Pages 447-458
    9. Mark Braverman, Omri Weinstein
      Pages 459-470
    10. Amit Chakrabarti, Ranganath Kondapally, Zhenghui Wang
      Pages 483-494
    11. Eshan Chattopadhyay, Adam Klivans, Pravesh Kothari
      Pages 495-504
    12. Varsha Dani, Cristopher Moore, Anna Olson
      Pages 505-516
    13. Anirban Dasgupta, Ravi Kumar, D. Sivakumar
      Pages 517-528
    14. Adrian Dumitrescu, Minghui Jiang
      Pages 529-540
    15. Alan Frieze, Charalampos E. Tsourakakis
      Pages 541-552
    16. Oded Goldreich, Igor Shinkar
      Pages 565-578
    17. Prateek Jain, Abhradeep Thakurta
      Pages 579-590

About these proceedings


This book constitutes the joint refereed proceedings of the 15th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2012, and the 16th International Workshop on Randomization and Computation, RANDOM 2012, held in Cambridge, Massachusetts, USA, in August 2011. The volume contains 28 contributed papers, selected by the APPROX Program Committee out of 70 submissions, and 28 contributed papers, selected by the RANDOM Program Committee out of 67 submissions. 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.


NP-hardness approximation algorithms graphs online scheduling random combinatorial structures

Editors and affiliations

  • Anupam Gupta
    • 1
  • Klaus Jansen
    • 2
  • José Rolim
    • 3
  • Rocco Servedio
    • 4
  1. 1.Department of Computer ScienceCarnegie Mellon UniversityPittsburghUSA
  2. 2.Department of Computer ScienceUniversity KielKielGermany
  3. 3.Centre Universitaire d’InformatiqueUniversity of GenevaCarougeSwitzerland
  4. 4.Department of Computer Science, Foundation School of Engineering and Applied ScienceColumbia UniversityNew YorkUSA

Bibliographic information

  • DOI
  • Copyright Information Springer-Verlag Berlin Heidelberg 2012
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science Computer Science (R0)
  • Print ISBN 978-3-642-32511-3
  • Online ISBN 978-3-642-32512-0
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site
Industry Sectors
Materials & Steel
Finance, Business & Banking
IT & Software
Consumer Packaged Goods
Energy, Utilities & Environment