3. APPROX 2000: Saarbrücken, Germany

@proceedings{DBLP:conf/approx/2000,
  editor    = {Klaus Jansen and
               Samir Khuller},
  title     = {Approximation Algorithms for Combinatorial Optimization, Third
               International Workshop, APPROX 2000, Saarbr{\"u}cken, Germany,
               September 5-8, 2000, Proceedings},
  booktitle = {APPROX},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {1913},
  year      = {2000},
  isbn      = {3-540-67996-0},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Invited Talks

• Sanjeev Arora:
  Approximation algorithms that take advice. 1
  Electronic Edition (Springer LINK) BibTeX
• Dorit S. Hochbaum:
  Instant recognition of polynominal time solvability, half integrality and 2-approximations. 2-14
  Electronic Edition (Springer LINK) BibTeX
• Rolf H. Möhring:
  Scheduling under uncertainty: Optimizing against a randomizing adversary. 15-26
  Electronic Edition (Springer LINK) BibTeX
• David B. Shmoys:
  Approximation algorithms for facility location problems. 27-33
  Electronic Edition (Springer LINK) BibTeX

Contributed Talks

• Alexander A. Ageev, Refael Hassin, Maxim Sviridenko:
  An approximation algorithm for MAX DICUT with given sizes of parts. 34-41
  Electronic Edition (Springer LINK) BibTeX
• Baruch Awerbuch, Yossi Azar, Oded Regev:
  Maximizing job benefits on-line. 42-50
  Electronic Edition (Springer LINK) BibTeX
• Piotr Berman, Junichiro Fukuyama:
  Variable length sequencing with two lengths. 51-59
  Electronic Edition (Springer LINK) BibTeX
• Vincenzo Auletta, Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano:
  Randomized path coloring on binary trees. 60-71
  Electronic Edition (Springer LINK) BibTeX
• Alberto Caprara, Giuseppe F. Italiano, G. Mohan, Alessandro Panconesi, Aravind Srinivasan:
  Wavelength rerouting in optical networks, or the Venetian routing problem. 72-83
  Electronic Edition (Springer LINK) BibTeX
• Moses Charikar:
  Greedy approximation algorithms for finding dense components in a graph. 84-95
  Electronic Edition (Springer LINK) BibTeX
• Bhaskar DasGupta, Michael A. Palis:
  Online real-time preemptive scheduling of jobs with deadlines. 96-107
  Electronic Edition (Springer LINK) BibTeX
• Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum:
  On the relative complexity of approximate counting problems. 108-119
  Electronic Edition (Springer LINK) BibTeX
• Uriel Feige, Michael Langberg, Kobbi Nissim:
  On the hardness of approximating N P witnesses. 120-131
  Electronic Edition (Springer LINK) BibTeX
• Sándor P. Fekete, Henk Meijer:
  Maximum dispersion and geometric maximum weight cliques. 132-143
  Electronic Edition (Springer LINK) BibTeX
• Rudolf Fleischer, Steven S. Seiden:
  New results for online page replication. 144-154
  Electronic Edition (Springer LINK) BibTeX
• Venkatesan Guruswami:
  Inapproximability results for set splitting and satisfiability problems with no mixed clauses. 155-166
  Electronic Edition (Springer LINK) BibTeX
• Refael Hassin, R. Ravi, F. Sibel Salman:
  Approximation algorithms for a capacitated network design problem. 167-176
  Electronic Edition (Springer LINK) BibTeX
• Kamal Jain, Vijay V. Vazirani:
  An approximation algorithm for the fault tolerant metric facility location problem. 177-183
  Electronic Edition (Springer LINK) BibTeX
• Jochen Könemann, Goran Konjevod, Ojas Parekh, Amitabh Sinha:
  Improved approximations for tour and tree covers. 184-193
  Electronic Edition (Springer LINK) BibTeX
• Guy Kortsarz, Zeev Nutov:
  Approximating node connectivity problems via set covers. 194-205
  Electronic Edition (Springer LINK) BibTeX
• Krzysztof Lorys, Katarzyna E. Paluch:
  Rectangle tiling. 206-213
  Electronic Edition (Springer LINK) BibTeX
• Tobias Polzin, Siavash Vahdati Daneshmand:
  Primal-dual approaches to the Steiner problem. 214-225
  Electronic Edition (Springer LINK) BibTeX
• Christian Schindelhauer:
  On the inapproximability of broadcasting time. 226-237
  Electronic Edition (Springer LINK) BibTeX
• Hadas Shachnai, Tami Tamir:
  Polynominal time approximation schemes for class-constrained packing problem. 238-249
  Electronic Edition (Springer LINK) BibTeX
• Rob van Stee, Johannes A. La Poutré:
  Partial servicing of on-line jobs. 250-261
  Electronic Edition (Springer LINK) BibTeX
• Santosh Vempala, Adrian Vetta:
  Factor 4/3 approximations for minimum 2-connected subgraphs. 262-273
  Electronic Edition (Springer LINK) BibTeX