Advertisement

Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques

8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2005 and 9th International Workshop on Randomization and Computation, RANDOM 2005, Berkeley, CA, USA, August 22-24, 2005. Proceedings

  • Chandra Chekuri
  • Klaus Jansen
  • José D. P. Rolim
  • Luca Trevisan
Conference proceedings APPROX 2005, RANDOM 2005

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

Table of contents

  1. Front Matter
  2. Contributed Talks of APPROX

    1. Stanislav Angelov, Sanjeev Khanna, Keshav Kunal
      Pages 1-13
    2. Kamalika Chaudhuri, Satish Rao, Samantha Riesenfeld, Kunal Talwar
      Pages 26-39
    3. Victor Chepoi, Karim Nouioua, Yann Vaxès
      Pages 40-51
    4. Joseph Cheriyan, Mohammad R. Salavatipour
      Pages 52-61
    5. Uriel Feige, Kunal Talwar
      Pages 62-73
    6. Anupam Gupta, Martin Pál, Ramamoorthi Ravi, Amitabh Sinha
      Pages 86-98
    7. Venkatesan Guruswami, Luca Trevisan
      Pages 99-110
    8. Alexander Hall, Christos Papadimitriou
      Pages 111-122
    9. Boulos Harb, Sampath Kannan, Andrew McGregor
      Pages 123-133
    10. Gustav Hast
      Pages 134-145
    11. V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan
      Pages 146-157
    12. Andrew McGregor
      Pages 170-181
    13. Shlomo Moran, Sagi Snir
      Pages 192-208
    14. Viswanath Nagarajan, Ramamoorthi Ravi
      Pages 209-220
  3. Contributed Talks of RANDOM

    1. Sourav Chakraborty, Jaikumar Radhakrishnan, Nandakumar Raghunathan
      Pages 245-256
    2. Moses Charikar, Chandra Chekuri, Martin Pál
      Pages 257-269
    3. Zeev Dvir, Amir Shpilka
      Pages 270-281
    4. Uriel Feige, Eran Ofek
      Pages 282-293
    5. Ronen Gradwohl, Guy Kindler, Omer Reingold, Amnon Ta-Shma
      Pages 294-305
    6. Venkatesan Guruswami, Atri Rudra
      Pages 306-317
    7. Venkatesan Guruswami, Salil Vadhan
      Pages 318-329
    8. Shirley Halevy, Eyal Kushilevitz
      Pages 330-341
    9. Jeffrey C. Jackson, Rocco A. Servedio
      Pages 342-353
    10. Eyal Kaplan, Moni Naor, Omer Reingold
      Pages 354-365
    11. Oded Lachish, Ilan Newman
      Pages 366-377
    12. Martin Marciniszyn, Reto Spöhel, Angelika Steger
      Pages 390-401
    13. Cristopher Moore, Gabriel Istrate, Demetrios Demopoulos, Moshe Y. Vardi
      Pages 414-425
    14. Dana Randall, Peter Winkler
      Pages 426-435
    15. Eyal Rozenman, Salil Vadhan
      Pages 436-447
    16. Raphael Yuster
      Pages 482-493
  4. Back Matter

About these proceedings

Keywords

Graph Partition algorithms analysis combinatorial optimization complexity complexity theory game theory optimization programming scheduling

Editors and affiliations

  • Chandra Chekuri
    • 1
  • Klaus Jansen
    • 2
  • José D. P. Rolim
    • 3
  • Luca Trevisan
    • 4
  1. 1.Dept. of Computer ScienceUniversity of IllinoisUrbana
  2. 2.Institute for Computer ScienceUniversity of KielKielGermany
  3. 3.Battelle Bâtiment ACentre Universitaire d’InformatiqueCarouge, GenevaSwitzerland
  4. 4.UC Berkeley 

Bibliographic information

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