3. APPROX 2000: Saarbrücken, Germany
Klaus Jansen, Samir Khuller (Eds.): Approximation Algorithms for Combinatorial Optimization, Third International Workshop, APPROX 2000, Saarbrücken, Germany, September 5-8, 2000, Proceedings. Springer 2000 Lecture Notes in Computer Science ISBN 3-540-67996-0
Invited Talks
- Sanjeev Arora: Approximation algorithms that take advice. 1
- Dorit S. Hochbaum: Instant recognition of polynominal time solvability, half integrality and 2-approximations. 2-14
- Rolf H. Möhring: Scheduling under uncertainty: Optimizing against a randomizing adversary. 15-26
- David B. Shmoys: Approximation algorithms for facility location problems. 27-33
Contributed Talks
- Alexander A. Ageev, Refael Hassin, Maxim Sviridenko: An approximation algorithm for MAX DICUT with given sizes of parts. 34-41
- Vincenzo Auletta, Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano: Randomized path coloring on binary trees. 60-71
- Alberto Caprara, Giuseppe F. Italiano, G. Mohan, Alessandro Panconesi, Aravind Srinivasan: Wavelength rerouting in optical networks, or the Venetian routing problem. 72-83
- Moses Charikar: Greedy approximation algorithms for finding dense components in a graph. 84-95
- Bhaskar DasGupta, Michael A. Palis: Online real-time preemptive scheduling of jobs with deadlines. 96-107
- Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum: On the relative complexity of approximate counting problems. 108-119
- Uriel Feige, Michael Langberg, Kobbi Nissim: On the hardness of approximating N P witnesses. 120-131
- Venkatesan Guruswami: Inapproximability results for set splitting and satisfiability problems with no mixed clauses. 155-166
- Refael Hassin, R. Ravi, F. Sibel Salman: Approximation algorithms for a capacitated network design problem. 167-176
- Kamal Jain, Vijay V. Vazirani: An approximation algorithm for the fault tolerant metric facility location problem. 177-183
- Jochen Könemann, Goran Konjevod, Ojas Parekh, Amitabh Sinha: Improved approximations for tour and tree covers. 184-193
- Christian Schindelhauer: On the inapproximability of broadcasting time. 226-237
- Hadas Shachnai, Tami Tamir: Polynominal time approximation schemes for class-constrained packing problem. 238-249
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-18T214307 by the dblp team