APPROX

Keyphrases

Publications

2002

Amit Chakrabarti, Chandra Chekuri, Anupam Gupta, Amit Kumar
Approximation Algorithms for the Unsplittable Flow Problem. APPROX (2002)
Joachim Gudmundsson, Herman J. Haverkort, Sang-Min Park, Chan-Su Shin, Alexander Wolff
Facility Location and the Geometric Minimum-Diameter Spanning Tree. APPROX (2002)
Refael Hassin, Asaf Levin
Minimum Restricted Diameter Spanning Trees. APPROX (2002)
R. Ravi
Bicriteria Spanning Tree Problems. APPROX (2002)
Nitin Ahuja, Anand Srivastav
On Constrained Hypergraph Coloring and Scheduling. APPROX (2002)
Yuval Rabani
Search and Classification of High Dimensional Data. APPROX (2002)
Ruy Luiz Milidiú, Artur Alves Pessoa, Eduardo Sany Laber
Complexity of Makespan Minimization for Pipeline Transportation of Petroleum Products. APPROX (2002)
Guy Kortsarz, Robert Krauthgamer, James R. Lee
Hardness of Approximation for Vertex-Connectivity Network-Design Problems. APPROX (2002)
Eran Halperin, Aravind Srinivasan
Improved Approximation Algorithms for the Partial Vertex Cover Problem. APPROX (2002)
Markus Bläser, Bodo Manthey
Two Approximation Algorithms for 3-Cycle Covers. APPROX (2002)
Liane Lewin-Eytan, Joseph Naor, Ariel Orda
Routing and Admission Control in Networks with Advance Reservations. APPROX (2002)
Spyros Angelopoulos, Allan Borodin
On the Power of Priority Algorithms for Facility Location and Set Cover. APPROX (2002)
Benjamin Doerr
Typical Rounding Problems. APPROX (2002)
Ganeshkumar Ganapathy, Tandy J. Warnow
Approximating the Complement of the Maximum Compatible Subset of Leaves of k Trees. APPROX (2002)
Chaitanya Swamy, Amit Kumar
Primal-Dual Algorithms for Connected Facility Location Problems. APPROX (2002)
Krzysztof Giaro, Robert Janczewski, Marek Kubale, Michal Malafiejski
A 27/26-Approximation Algorithm for the Chromatic Sum Coloring of Bipartite Graphs. APPROX (2002)
Alexander A. Ageev
Improved Approximation Algorithms for Multilevel Facility Location Problems. APPROX (2002)
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. APPROX (2002)
Uriel Feige, László Lovász, Prasad Tetali
Approximating Min-sum Set Cover. APPROX (2002)
Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos
-Approximation for Treewidth of Graphs Excluding a Graph with One Crossing as a Minor. APPROX (2002)
Mohammad Mahdian, Yinyu Ye, Jiawei Zhang
Improved Approximation Algorithms for Metric Facility Location Problems. APPROX (2002)
Uriel Feige, Eran Ofek, Udi Wieder
Approximating Maximum Edge Coloring in Multigraphs. APPROX (2002)

volume 2462, 2002

Approximation Algorithms for Combinatorial Optimization, 5th International Workshop, APPROX 2002, Rome, Italy, September 17-21, 2002, Proceedings APPROX 2462 (2002)

2000

volume 1913, 2000

Approximation Algorithms for Combinatorial Optimization, Third International Workshop, APPROX 2000, Saarbrücken, Germany, September 5-8, 2000, Proceedings APPROX 1913 (2000)