default search action
5th APPROX 2002: Rome, Italy
- Klaus Jansen, Stefano Leonardi, Vijay V. Vazirani:
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 - Yuval Rabani:
Search and Classification of High Dimensional Data. 1-2 - R. Ravi:
Bicriteria Spanning Tree Problems. 3-4 - Alexander A. Ageev:
Improved Approximation Algorithms for Multilevel Facility Location Problems. 5-13 - Nitin Ahuja, Anand Srivastav:
On Constrained Hypergraph Coloring and Scheduling. 14-25 - Spyros Angelopoulos, Allan Borodin:
On the Power of Priority Algorithms for Facility Location and Set Cover. 26-39 - Markus Bläser, Bodo Manthey:
Two Approximation Algorithms for 3-Cycle Covers. 40-50 - Amit Chakrabarti, Chandra Chekuri, Anupam Gupta, Amit Kumar
:
Approximation Algorithms for the Unsplittable Flow Problem. 51-66 - 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 - Benjamin Doerr:
Typical Rounding Problems. 81-93 - Uriel Feige, László Lovász, Prasad Tetali:
Approximating Min-sum Set Cover. 94-107 - Uriel Feige, Eran Ofek, Udi Wieder:
Approximating Maximum Edge Coloring in Multigraphs. 108-121 - Ganeshkumar Ganapathy, Tandy J. Warnow:
Approximating the Complement of the Maximum Compatible Subset of Leaves of k Trees. 122-134 - Krzysztof Giaro, Robert Janczewski, Marek Kubale, Michal Malafiejski:
A 27/26-Approximation Algorithm for the Chromatic Sum Coloring of Bipartite Graphs. 135-145 - Joachim Gudmundsson, Herman J. Haverkort, Sang-Min Park, Chan-Su Shin, Alexander Wolff:
Facility Location and the Geometric Minimum-Diameter Spanning Tree. 146-160 - Eran Halperin, Aravind Srinivasan:
Improved Approximation Algorithms for the Partial Vertex Cover Problem. 161-174 - Refael Hassin, Asaf Levin
Minimum Restricted Diameter Spanning Trees. 175-184 - Guy Kortsarz, Robert Krauthgamer
Hardness of Approximation for Vertex-Connectivity Network-Design Problems. 185-199 - 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 - Liane Lewin-Eytan, Joseph Naor, Ariel Orda:
Routing and Admission Control in Networks with Advance Reservations. 215-228 - Mohammad Mahdian, Yinyu Ye, Jiawei Zhang:
Improved Approximation Algorithms for Metric Facility Location Problems. 229-242 - Ruy Luiz Milidiú, Artur Alves Pessoa, Eduardo Sany Laber:
Complexity of Makespan Minimization for Pipeline Transportation of Petroleum Products. 243-255 - Chaitanya Swamy, Amit Kumar
Primal-Dual Algorithms for Connected Facility Location Problems. 256-270
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-15 01:14 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: