
Conferences in DBLP
 Yuval Rabani
Search and Classification of High Dimensional Data. [Citation Graph (0, 0)][DBLP] APPROX, 2002, pp:12 [Conf]
 R. Ravi
Bicriteria Spanning Tree Problems. [Citation Graph (0, 0)][DBLP] APPROX, 2002, pp:34 [Conf]
 Alexander A. Ageev
Improved Approximation Algorithms for Multilevel Facility Location Problems. [Citation Graph (0, 0)][DBLP] APPROX, 2002, pp:513 [Conf]
 Nitin Ahuja, Anand Srivastav
On Constrained Hypergraph Coloring and Scheduling. [Citation Graph (0, 0)][DBLP] APPROX, 2002, pp:1425 [Conf]
 Spyros Angelopoulos, Allan Borodin
On the Power of Priority Algorithms for Facility Location and Set Cover. [Citation Graph (0, 0)][DBLP] APPROX, 2002, pp:2639 [Conf]
 Markus Bläser, Bodo Manthey
Two Approximation Algorithms for 3Cycle Covers. [Citation Graph (0, 0)][DBLP] APPROX, 2002, pp:4050 [Conf]
 Amit Chakrabarti, Chandra Chekuri, Anupam Gupta, Amit Kumar
Approximation Algorithms for the Unsplittable Flow Problem. [Citation Graph (0, 0)][DBLP] APPROX, 2002, pp:5166 [Conf]
 Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos
Approximation for Treewidth of Graphs Excluding a Graph with One Crossing as a Minor. [Citation Graph (0, 0)][DBLP] APPROX, 2002, pp:6780 [Conf]
 Benjamin Doerr
Typical Rounding Problems. [Citation Graph (0, 0)][DBLP] APPROX, 2002, pp:8193 [Conf]
 Uriel Feige, László Lovász, Prasad Tetali
Approximating Minsum Set Cover. [Citation Graph (0, 0)][DBLP] APPROX, 2002, pp:94107 [Conf]
 Uriel Feige, Eran Ofek, Udi Wieder
Approximating Maximum Edge Coloring in Multigraphs. [Citation Graph (0, 0)][DBLP] APPROX, 2002, pp:108121 [Conf]
 Ganeshkumar Ganapathy, Tandy Warnow
Approximating the Complement of the Maximum Compatible Subset of Leaves of k Trees. [Citation Graph (0, 0)][DBLP] APPROX, 2002, pp:122134 [Conf]
 Krzysztof Giaro, Robert Janczewski, Marek Kubale, Michal Malafiejski
A 27/26Approximation Algorithm for the Chromatic Sum Coloring of Bipartite Graphs. [Citation Graph (0, 0)][DBLP] APPROX, 2002, pp:135145 [Conf]
 Joachim Gudmundsson, Herman J. Haverkort, SangMin Park, ChanSu Shin, Alexander Wolff
Facility Location and the Geometric MinimumDiameter Spanning Tree. [Citation Graph (0, 0)][DBLP] APPROX, 2002, pp:146160 [Conf]
 Eran Halperin, Aravind Srinivasan
Improved Approximation Algorithms for the Partial Vertex Cover Problem. [Citation Graph (0, 0)][DBLP] APPROX, 2002, pp:161174 [Conf]
 Refael Hassin, Asaf Levin
Minimum Restricted Diameter Spanning Trees. [Citation Graph (0, 0)][DBLP] APPROX, 2002, pp:175184 [Conf]
 Guy Kortsarz, Robert Krauthgamer, James R. Lee
Hardness of Approximation for VertexConnectivity NetworkDesign Problems. [Citation Graph (0, 0)][DBLP] APPROX, 2002, pp:185199 [Conf]
 Sven Oliver Krumke, Luigi Laura, Maarten Lipmann, Alberto MarchettiSpaccamela, Willem de Paepe, Diana Poensgen, Leen Stougie
Nonabusiveness Helps: An O(1)Competitive Algorithm for Minimizing the Maximum Flow Time in the Online Traveling Salesman Problem. [Citation Graph (0, 0)][DBLP] APPROX, 2002, pp:200214 [Conf]
 Liane LewinEytan, Joseph Naor, Ariel Orda
Routing and Admission Control in Networks with Advance Reservations. [Citation Graph (0, 0)][DBLP] APPROX, 2002, pp:215228 [Conf]
 Mohammad Mahdian, Yinyu Ye, Jiawei Zhang
Improved Approximation Algorithms for Metric Facility Location Problems. [Citation Graph (0, 0)][DBLP] APPROX, 2002, pp:229242 [Conf]
 Ruy Luiz Milidiú, Artur Alves Pessoa, Eduardo Sany Laber
Complexity of Makespan Minimization for Pipeline Transportation of Petroleum Products. [Citation Graph (0, 0)][DBLP] APPROX, 2002, pp:243255 [Conf]
 Chaitanya Swamy, Amit Kumar
PrimalDual Algorithms for Connected Facility Location Problems. [Citation Graph (0, 0)][DBLP] APPROX, 2002, pp:256270 [Conf]
