Approximation Algorithms for Combinatorial Optimization

Third International Workshop, APPROX 2000 Saarbrücken, Germany, September 5–8, 2000 Proceedings

  • Klaus Jansen
  • Samir Khuller
Conference proceedings APPROX 2000

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

Table of contents

  1. Front Matter
    Pages I-IX
    PDF

  2. Invited Talks

    1. Approximation Algorithms That Take Advice
      Sanjeev Arora
      Pages 1-1
    2. Instant Recognition of Polynomial Time Solvability, Half Integrality, and 2-Approximations
      Dorit S. Hochbaum
      Pages 2-12
    3. Scheduling under Uncertainty: Optimizing against a Randomizing Adversary
      Rolf H. Möhring
      Pages 15-26
    4. Approximation Algorithms for Facility Location Problems
      David B. Shmoys
      Pages 27-32

  3. Contributed Talks

    1. An Approximation Algorithm for MAX DICUT with Given Sizes of Parts
      Alexander Ageev, Refael Hassin, Maxim Sviridenko
      Pages 34-41
    2. Maximizing Job Benefits On-Line
      Baruch Awerbuch, Yossi Azar, Oded Regev
      Pages 42-50
    3. Variable Length Sequencing with Two Lengths
      Piotr Berman, Junichiro Fukuyama
      Pages 51-59
    4. Randomized Path Coloring on Binary Trees
      Vincenzo Auletta, Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano
      Pages 60-71
    5. Wavelength Rerouting in Optical Networks, or the Venetian Routing Problem
      Alberto Caprara, Giuseppe F. Italiano, G. Mohan, Alessandro Panconesi, Aravind Srinivasan
      Pages 72-83
    6. Greedy Approximation Algorithms for Finding Dense Components in a Graph
      Moses Charikar
      Pages 84-95
    7. Online Real-Time Preemptive Scheduling of Jobs with Deadlines
      Bhaskar DasGupta, Michael A. Palis
      Pages 96-107
    8. On the Relative Complexity of Approximate Counting Problems
      Martin Dyer, Leslie Ann Goldberg, Catherine Greenhill, Mark Jerrum
      Pages 108-119
    9. On the Hardness of Approximating NP Witnesses
      Uriel Feige, Michael Langberg, Kobbi Nissim
      Pages 120-131
    10. Maximum Dispersion and Geometric Maximum Weight Cliques
      Sándor P. Fekete, Henk Meijer
      Pages 132-141
    11. New Results for Online Page Replication
      Rudolf Fleischer, Steve Seiden
      Pages 144-154
    12. Inapproximability Results for Set Splitting and Satisfiability Problems with No Mixed Clauses
      Venkatesan Guruswami
      Pages 155-166
    13. Approximation Algorithms for a Capacitated Network Design Problem
      R. Hassin, R. Ravi, F. S. Salman
      Pages 167-176
    14. An Approximation Algorithm for the Fault Tolerant Metric Facility Location Problem
      Kamal Jain, Vijay V. Vazirani
      Pages 177-182
    15. Improved Approximations for Tour and Tree Covers
      Jochen Könemann, Goran Konjevod, Ojas Parekh, Amitabh Sinha
      Pages 184-193

About these proceedings

Keywords

Approximate Solutions Approximation Approximation Algorithms Complexity Computational Geometry Computational Graph Theory Discrete Computational Mathematics algorithms combinatorial optimization scheduling

Editors and affiliations

  • Klaus Jansen
    • 1
  • Samir Khuller
    • 2
  1. 1.Christian-Albrechts-Universität zu Kiel Institut für Informatik und praktische Mathematik OlshausenstrKielGermany
  2. 2.Computer Science DepartmentUniversity of MarylandUSA

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-44436-X
  • Copyright Information Springer-Verlag Berlin Heidelberg 2000
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-67996-7
  • Online ISBN 978-3-540-44436-7
  • Series Print ISSN 0302-9743
  • Buy this book on publisher's site