|
|
Conferences in DBLP
- Yuval Rabani
Search and Classification of High Dimensional Data. [Citation Graph (0, 0)][DBLP]
APPROX, 2002, pp:1-2 [Conf]
- R. Ravi
Bicriteria Spanning Tree Problems. [Citation Graph (0, 0)][DBLP]
APPROX, 2002, pp:3-4 [Conf]
- Alexander A. Ageev
Improved Approximation Algorithms for Multilevel Facility Location Problems. [Citation Graph (0, 0)][DBLP]
APPROX, 2002, pp:5-13 [Conf]
- Nitin Ahuja, Anand Srivastav
On Constrained Hypergraph Coloring and Scheduling. [Citation Graph (0, 0)][DBLP]
APPROX, 2002, pp:14-25 [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:26-39 [Conf]
- Markus Bläser, Bodo Manthey
Two Approximation Algorithms for 3-Cycle Covers. [Citation Graph (0, 0)][DBLP]
APPROX, 2002, pp:40-50 [Conf]
- Amit Chakrabarti, Chandra Chekuri, Anupam Gupta, Amit Kumar
Approximation Algorithms for the Unsplittable Flow Problem. [Citation Graph (0, 0)][DBLP]
APPROX, 2002, pp:51-66 [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:67-80 [Conf]
- Benjamin Doerr
Typical Rounding Problems. [Citation Graph (0, 0)][DBLP]
APPROX, 2002, pp:81-93 [Conf]
- Uriel Feige, László Lovász, Prasad Tetali
Approximating Min-sum Set Cover. [Citation Graph (0, 0)][DBLP]
APPROX, 2002, pp:94-107 [Conf]
- Uriel Feige, Eran Ofek, Udi Wieder
Approximating Maximum Edge Coloring in Multigraphs. [Citation Graph (0, 0)][DBLP]
APPROX, 2002, pp:108-121 [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:122-134 [Conf]
- Krzysztof Giaro, Robert Janczewski, Marek Kubale, Michal Malafiejski
A 27/26-Approximation Algorithm for the Chromatic Sum Coloring of Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
APPROX, 2002, pp:135-145 [Conf]
- Joachim Gudmundsson, Herman J. Haverkort, Sang-Min Park, Chan-Su Shin, Alexander Wolff
Facility Location and the Geometric Minimum-Diameter Spanning Tree. [Citation Graph (0, 0)][DBLP]
APPROX, 2002, pp:146-160 [Conf]
- Eran Halperin, Aravind Srinivasan
Improved Approximation Algorithms for the Partial Vertex Cover Problem. [Citation Graph (0, 0)][DBLP]
APPROX, 2002, pp:161-174 [Conf]
- Refael Hassin, Asaf Levin
Minimum Restricted Diameter Spanning Trees. [Citation Graph (0, 0)][DBLP]
APPROX, 2002, pp:175-184 [Conf]
- Guy Kortsarz, Robert Krauthgamer, James R. Lee
Hardness of Approximation for Vertex-Connectivity Network-Design Problems. [Citation Graph (0, 0)][DBLP]
APPROX, 2002, pp:185-199 [Conf]
- 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. [Citation Graph (0, 0)][DBLP]
APPROX, 2002, pp:200-214 [Conf]
- Liane Lewin-Eytan, Joseph Naor, Ariel Orda
Routing and Admission Control in Networks with Advance Reservations. [Citation Graph (0, 0)][DBLP]
APPROX, 2002, pp:215-228 [Conf]
- Mohammad Mahdian, Yinyu Ye, Jiawei Zhang
Improved Approximation Algorithms for Metric Facility Location Problems. [Citation Graph (0, 0)][DBLP]
APPROX, 2002, pp:229-242 [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:243-255 [Conf]
- Chaitanya Swamy, Amit Kumar
Primal-Dual Algorithms for Connected Facility Location Problems. [Citation Graph (0, 0)][DBLP]
APPROX, 2002, pp:256-270 [Conf]
|
