Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques

6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, Princeton, NJ, USA, August 24-26, 2003. Proceedings

  • Sanjeev Arora
  • Klaus Jansen
  • José D. P. Rolim
  • Amit Sahai

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

Table of contents

  1. Front Matter
  2. Contributed Talks of APPROX

    1. Erik D. Demaine, Nicole Immorlica
      Pages 1-13
    2. Doratha E. Drake, Stefan Hougardy
      Pages 14-23
    3. G. Even, N. Garg, J. Könemann, R. Ravi, A. Sinha
      Pages 24-35
    4. Jittat Fakcharoenphol, Kunal Talwar
      Pages 36-46
    5. Rajiv Gandhi, Samir Khuller, Aravind Srinivasan, Nan Wang
      Pages 47-58
    6. Inge Li Gørtz, Anthony Wirth
      Pages 59-70
    7. Alex Hall, Katharina Langkau, Martin Skutella
      Pages 71-82
    8. Elad Hazan, Shmuel Safra, Oded Schwartz
      Pages 83-97
    9. Kamal Jain, Mohammad Mahdian, Amin Saberi
      Pages 98-108
    10. Jochen Könemann, Asaf Levin, Amitabh Sinha
      Pages 109-121
    11. Mohammad Mahdian, Yinyu Ye, Jiawei Zhang
      Pages 129-140
    12. Jay Sethuraman, Chung-Piaw Teo
      Pages 153-164
  3. Contributed Talks of RANDOM

    1. Noga Alon, Tali Kaufman, Michael Krivelevich, Simon Litsyn, Dana Ron
      Pages 188-199
    2. Boaz Barak, Ronen Shaltiel, Avi Wigderson
      Pages 200-215
    3. Eli Ben-Sasson, Oded Goldreich, Madhu Sudan
      Pages 216-227

About these proceedings

Introduction

This book constitutes the joint refereed proceedings of the 6th International Workshop on Approximation Algorithms for Optimization Problems, APPROX 2003 and of the 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, held in Princeton, NY, USA in August 2003.

The 33 revised full papers presented were carefully reviewed and selected from 74 submissions. Among the issues addressed are design and analysis of randomized and approximation algorithms, online algorithms, complexity theory, combinatorial structures, error-correcting codes, pseudorandomness, derandomization, network algorithms, random walks, Markov chains, probabilistic proof systems, computational learning, randomness in cryptography, and various applications.

Keywords

algorithm algorithms combinatorial optimization complexity complexity theory computer computer science optimization

Editors and affiliations

  • Sanjeev Arora
    • 1
  • Klaus Jansen
    • 2
  • José D. P. Rolim
    • 3
  • Amit Sahai
    • 4
  1. 1.Computer Science DepartmentPrinceton UniversityPrinceton
  2. 2.Institute for Computer ScienceUniversity of KielKielGermany
  3. 3.Battelle Bâtiment ACentre Universitaire d’InformatiqueCarouge, GenevaSwitzerland
  4. 4.University of CaliforniaLos Angeles

Bibliographic information

  • DOI https://doi.org/10.1007/b11961
  • Copyright Information Springer-Verlag Berlin Heidelberg 2003
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-40770-6
  • Online ISBN 978-3-540-45198-3
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book