Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques

4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2001 and 5th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2001 Berkeley, CA, USA, August 18–20, 2001 Proceedings

  • Michel Goemans
  • Klaus Jansen
  • José D. P. Rolim
  • Luca Trevisan

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

Table of contents

  1. Front Matter
    Pages I-IX
  2. Invited Talks

  3. Contributed Talks of APPROX

    1. Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Kirk R. Pruhs
      Pages 36-47
    2. Piotr Berman, Junichiro Fukuyama
      Pages 48-54
    3. Alberto Caprara, Hans Kellerer, Ulrich Pferschy
      Pages 63-75
    4. Yevgeniy Dodis, Shai Halevi
      Pages 75-90
    5. Rahul Garg, Vijay Kumar, Vinayaka Pandit
      Pages 102-113
    6. Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai
      Pages 114-126
    7. Mohammad Mahdian, Evangelos Markakis, Amin Saberi, Vijay Vazirani
      Pages 127-137
    8. Shiro Matuura, Tomomi Matsui
      Pages 138-146
    9. Estela Maris Rodrigues, Marie-France Sagot, Yoshiko Wakabayashi
      Pages 159-169

About these proceedings

Introduction

This book constitutes the joint refereed proceedings of the 4th International Workshop on Approximation Algorithms for Optimization Problems, APPROX 2001 and of the 5th International Workshop on Ranomization and Approximation Techniques in Computer Science, RANDOM 2001, held in Berkeley, California, USA in August 2001. The 26 revised full papers presented were carefully reviewed and selected from a total of 54 submissions. Among the issues addressed are design and analysis of approximation algorithms, inapproximability results, on-line problems, randomization, de-randomization, average-case analysis, approximation classes, randomized complexity theory, scheduling, routing, coloring, partitioning, packing, covering, computational geometry, network design, and applications in various fields.

Keywords

Partition algorithms analysis combinatorial optimization complexity complexity theory computational geometry computer computer science optimization scheduling

Editors and affiliations

  • Michel Goemans
    • 1
  • Klaus Jansen
    • 2
  • José D. P. Rolim
    • 3
  • Luca Trevisan
    • 4
  1. 1.Department of MathematicsMassachusetts Institute of Technology, MITCambridgeUSA
  2. 2.Institute for Computer Science and Applied MathematicsUniversity of KielKielGermany
  3. 3.Centre Universitaire d’InformatiqueUniversité de GenéveGenéve 4Switzerland
  4. 4.Computer Science DivisionUniversity of California at BerkeleyBerkeleyUSA

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-44666-4
  • Copyright Information Springer-Verlag Berlin Heidelberg 2001
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-42470-3
  • Online ISBN 978-3-540-44666-8
  • Series Print ISSN 0302-9743
  • About this book