Advertisement

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006 and 10th International Workshop on Randomization and Computation, RANDOM 2006, Barcelona, Spain, August 28-30 2006. Proceedings

  • Josep Díaz
  • Klaus Jansen
  • José D. P. Rolim
  • Uri Zwick
Conference proceedings APPROX 2006, RANDOM 2006

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

Table of contents

  1. Front Matter
  2. Invited Talks

  3. Contributed Talks of APPROX

    1. Christoph Ambühl, Thomas Erlebach, Matúš Mihalák, Marc Nunkesser
      Pages 3-14
    2. Christoph Ambühl, Monaldo Mastrolilli, Ola Svensson
      Pages 15-26
    3. Nikhil Bansal, Don Coppersmith, Baruch Schieber
      Pages 27-38
    4. Yair Bartal, Stefano Leonardi, Gil Shallom, Rene Sitters
      Pages 39-48
    5. Jean Cardinal, Samuel Fiorini, Gwenaël Joret
      Pages 61-69
    6. T. -H. Hubert Chan, Donglin Xia, Goran Konjevod, Andrea Richa
      Pages 70-81
    7. Shuchi Chawla, Tim Roughgarden
      Pages 82-94
    8. Sashka Davis, Jeff Edmonds, Russell Impagliazzo
      Pages 104-115
    9. Leah Epstein, Magnús M. Halldórsson, Asaf Levin, Hadas Shachnai
      Pages 116-127
    10. M. T. Hajiaghayi, G. Kortsarz, M. R. Salavatipour
      Pages 152-163
    11. Samir Khuller, Yoo-Ah Kim, Azarakhsh Malekian
      Pages 164-175
    12. Michael Langberg, Yuval Rabani, Chaitanya Swamy
      Pages 176-187
    13. Viswanath Nagarajan, R. Ravi
      Pages 212-223
    14. Anthony Man–Cho So, Jiawei Zhang, Yinyu Ye
      Pages 224-235
  4. Contributed Talks of RANDOM

    1. Benny Applebaum, Yuval Ishai, Eyal Kushilevitz
      Pages 260-271
    2. Sanjeev Arora, Elad Hazan, Satyen Kale
      Pages 272-279
    3. Nayantara Bhatnagar, Sam Greenberg, Dana Randall
      Pages 280-291
    4. Amit Deshpande, Santosh Vempala
      Pages 292-303
    5. Irit Dinur, Madhu Sudan, Avi Wigderson
      Pages 304-315
    6. Petros Drineas, Michael W. Mahoney, S. Muthukrishnan
      Pages 316-326
    7. Martin Dyer, Leslie Ann Goldberg, Mark Jerrum
      Pages 327-338
    8. Uriel Feige, Elchanan Mossel, Dan Vilenchik
      Pages 339-350
    9. Murali K. Ganapathy
      Pages 351-362
    10. Oded Goldreich, Dana Ron
      Pages 363-374
    11. Elena Grigorescu, Swastik Kopparty, Madhu Sudan
      Pages 375-385
    12. Alexander Healy
      Pages 398-409
    13. Shlomo Hoory, Avner Magen, Toniann Pitassi
      Pages 410-425
    14. Oded Lachish, Ilan Newman, Asaf Shapira
      Pages 426-437
    15. Yi-Kai Liu, Vadim Lyubashevsky, Daniele Micciancio
      Pages 450-461
    16. Martin Marciniszyn, Jozef Skokan, Reto Spöhel, Angelika Steger
      Pages 462-474
    17. Rajeev Motwani, Rina Panigrahy, Ying Xu
      Pages 487-498
    18. Thomas Strohmer, Roman Vershynin
      Pages 499-507
  5. Back Matter

About these proceedings

Keywords

algorithm algorithms combinatorial optimization complexity complexity theory game theory optimization programming

Editors and affiliations

  • Josep Díaz
    • 1
  • Klaus Jansen
    • 2
  • José D. P. Rolim
    • 3
  • Uri Zwick
    • 4
  1. 1.Departament de Llenguatges i Sistemes InformaticsUniversitat Politecnica de CatalunyaBarcelona
  2. 2.Institute for Computer ScienceUniversity of KielKielGermany
  3. 3.Centre Universitaire d’InformatiqueCarougeSwitzerland
  4. 4.School of Computer ScienceTel Aviv UniversityTel AvivIsrael

Bibliographic information

  • DOI https://doi.org/10.1007/11830924
  • Copyright Information Springer-Verlag Berlin Heidelberg 2006
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-540-38044-3
  • Online ISBN 978-3-540-38045-0
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site