List of accepted papers for APPROX 2002:


Improved approximation algorithms for metric facility location
Mohammad Mahdian and Yinyu Ye and Jiawei Zhang

Two Approximation Algorithms for 3-Cycle Covers
Markus Blaeser and Bodo Siebert

Approximating Maximum Edge Coloring in Multigraphs
Uriel Feige and Eran Ofek and Udi Wieder

Approximation Algorithms for the Unsplittable Flow Problem.
A. Chakrabarti and C. Chekuri and A. Gupta and A. Kumar

Approximating Min-sum Set Cover
U. Feige and L. Lovasz and P. Tetali

Approximating the Geometric Minimum-Diameter Spanning Tree
Joachim Gudmundsson and Herman Haverkort and Sang-Min Park and Chan-Su Shin and Alexander Wolff

1.5-Approximation for Treewidth of Graphs Excluding a Graph with One Crossing as a Minor
Erik D. Demaine and MohammadTaghi Hajiaghayi and Dimitrios M. Thilikos

Hardness of approximation for vertex-connectivity network design
Guy Kortsarz and Robert Krauthgamer and James R. Lee

Improved approximation algorithms for the partial vertex cover problem
Eran Halperin and Aravind Srinivasan

Non-Abusiveness Helps: An O(1)-Competitive Algorithm for Minimizing the Maximum Flow Time in the Online Traveling Salesman Problem
Sven O. Krumke and Luigi Laura and Maarten Lipmann and Alberto Marchetti-Spaccamela and Willem E. de Paepe and Diana Poensgen and Leen Stougie

Improved Approximation Algorithms for Multilevel Facility
Alexander A. Ageev

On the Power of Priority Algorithms for Facility Location and Set
Spyros Angelopoulos and Allan Borodin

Primal-Dual Algorithms for Connected Facility Location Problems
Chaitanya Swami and Amit Kumar

A 27/26-approximation algorithm for the chromatic sum coloring of bipartite graphs
Krzysztof Giaro and Robert Janczewski and Marek Kubale and Michal Malafiejski

Complexity of Makespan Minimization for Pipeline Transportation of Petroleum Products
Ruy Luiz Milidi£ and Artur Alves Pessoa and Eduardo Sany Laber

On Constrained Hypergraph Coloring and Scheduling
Nitin Ahuja and Anand Srivastav

Typical Rounding Problems
Benjamin Doerr

Approximating the complement of the maximum compatible subset of leaves of k trees
Ganeshkumar Ganapathy and Tandy Warnow

Minimum restricted diameter spanning trees
Refael Hassin and Asaf Levin

Routing and Admission Control in Networks with Advance Reservations
Liane Lewin-Eytan and Joseph (Seffi) Naor and Ariel Orda