5. APPROX 2002:
Rome,
Italy
Klaus Jansen, Stefano Leonardi, Vijay V. Vazirani (Eds.):
Approximation Algorithms for Combinatorial Optimization, 5th International Workshop, APPROX 2002, Rome, Italy, September 17-21, 2002, Proceedings.
Lecture Notes in Computer Science 2462 Springer 2002, ISBN 3-540-44186-7 BibTeX
@proceedings{DBLP:conf/approx/2002,
editor = {Klaus Jansen and
Stefano Leonardi and
Vijay V. Vazirani},
title = {Approximation Algorithms for Combinatorial Optimization, 5th
International Workshop, APPROX 2002, Rome, Italy, September 17-21,
2002, Proceedings},
booktitle = {APPROX},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {2462},
year = {2002},
isbn = {3-540-44186-7},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
- Yuval Rabani:
Search and Classification of High Dimensional Data.
1-2
Electronic Edition (Springer LINK) BibTeX
- R. Ravi:
Bicriteria Spanning Tree Problems.
3-4
Electronic Edition (Springer LINK) BibTeX
- Alexander A. Ageev:
Improved Approximation Algorithms for Multilevel Facility Location Problems.
5-13
Electronic Edition (Springer LINK) BibTeX
- Nitin Ahuja, Anand Srivastav:
On Constrained Hypergraph Coloring and Scheduling.
14-25
Electronic Edition (Springer LINK) BibTeX
- Spyros Angelopoulos, Allan Borodin:
On the Power of Priority Algorithms for Facility Location and Set Cover.
26-39
Electronic Edition (Springer LINK) BibTeX
- Markus Bläser, Bodo Manthey:
Two Approximation Algorithms for 3-Cycle Covers.
40-50
Electronic Edition (Springer LINK) BibTeX
- Amit Chakrabarti, Chandra Chekuri, Anupam Gupta, Amit Kumar:
Approximation Algorithms for the Unsplittable Flow Problem.
51-66
Electronic Edition (Springer LINK) BibTeX
- Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos:
-Approximation for Treewidth of Graphs Excluding a Graph with One Crossing as a Minor.
67-80
Electronic Edition (Springer LINK) BibTeX
- Benjamin Doerr:
Typical Rounding Problems.
81-93
Electronic Edition (Springer LINK) BibTeX
- Uriel Feige, László Lovász, Prasad Tetali:
Approximating Min-sum Set Cover.
94-107
Electronic Edition (Springer LINK) BibTeX
- Uriel Feige, Eran Ofek, Udi Wieder:
Approximating Maximum Edge Coloring in Multigraphs.
108-121
Electronic Edition (Springer LINK) BibTeX
- Ganeshkumar Ganapathy, Tandy Warnow:
Approximating the Complement of the Maximum Compatible Subset of Leaves of k Trees.
122-134
Electronic Edition (Springer LINK) BibTeX
- Krzysztof Giaro, Robert Janczewski, Marek Kubale, Michal Malafiejski:
A 27/26-Approximation Algorithm for the Chromatic Sum Coloring of Bipartite Graphs.
135-145
Electronic Edition (Springer LINK) BibTeX
- Joachim Gudmundsson, Herman J. Haverkort, Sang-Min Park, Chan-Su Shin, Alexander Wolff:
Facility Location and the Geometric Minimum-Diameter Spanning Tree.
146-160
Electronic Edition (Springer LINK) BibTeX
- Eran Halperin, Aravind Srinivasan:
Improved Approximation Algorithms for the Partial Vertex Cover Problem.
161-174
Electronic Edition (Springer LINK) BibTeX
- Refael Hassin, Asaf Levin:
Minimum Restricted Diameter Spanning Trees.
175-184
Electronic Edition (Springer LINK) BibTeX
- Guy Kortsarz, Robert Krauthgamer, James R. Lee:
Hardness of Approximation for Vertex-Connectivity Network-Design Problems.
185-199
Electronic Edition (Springer LINK) BibTeX
- Sven Oliver Krumke, Luigi Laura, Maarten Lipmann, Alberto Marchetti-Spaccamela, Willem de Paepe, Diana Poensgen, Leen Stougie:
Non-abusiveness Helps: An O(1)-Competitive Algorithm for Minimizing the Maximum Flow Time in the Online Traveling Salesman Problem.
200-214
Electronic Edition (Springer LINK) BibTeX
- Liane Lewin-Eytan, Joseph Naor, Ariel Orda:
Routing and Admission Control in Networks with Advance Reservations.
215-228
Electronic Edition (Springer LINK) BibTeX
- Mohammad Mahdian, Yinyu Ye, Jiawei Zhang:
Improved Approximation Algorithms for Metric Facility Location Problems.
229-242
Electronic Edition (Springer LINK) BibTeX
- Ruy Luiz Milidiú, Artur Alves Pessoa, Eduardo Sany Laber:
Complexity of Makespan Minimization for Pipeline Transportation of Petroleum Products.
243-255
Electronic Edition (Springer LINK) BibTeX
- Chaitanya Swamy, Amit Kumar:
Primal-Dual Algorithms for Connected Facility Location Problems.
256-270
Electronic Edition (Springer LINK) BibTeX
Copyright © Sat May 16 22:58:16 2009
by Michael Ley (ley@uni-trier.de)