S. O. Krumke, H. Noltemeier, S. S. Ravi, M. V. Marathe  Home/Search
Context
Related
| zib.de/krumke/Postscript/wg95.ps.gz info1.informatik.uniwuerz...wg95.ps.gz info1.informatik.uniwuerz...wg95.ps.gz Cached: PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
PS.gz PS Image Update HelpFrom: zib.de/krumke/publications (more) From: info1.informatik.u...publications (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . We investigate the complexity and approximability of some location problems when two distance values are specified for each pair of potential sites. These problems involve the selection of a specified number of facilities (i.e. a placement of a specified size) to minimize a function of one distance metric subject to a budget constraint on the other distance metric. Such problems arise in several application areas including statistical clustering, pattern recognition and load--balancing in... (Update)
Similar documents (at the sentence level):
9.5%: Compact Location Problems - Krumke, Marathe, Noltemeier.. (1997) (Correct)
8.5%: On the Approximability of Location and Network Design Problems - Krumke (1996) (Correct)
6.0%: Compact Location Problems with Budget and.. - Krumke, Noltemeier.. (1995) (Correct)
Active bibliography (related documents): More All
1.2: Bicriteria Compact Location Problems - Krumke, Noltemeier, Ravi, Marathe (1995) (Correct)
0.4: Steiner Trees and Beyond: Approximation Algorithms for Network.. - Ravi (1993) (Correct)
0.3: Compact Location Problems (Extended Abstract) - Radhakrishnan, Krumke.. (Correct)
Similar documents based on text: More All
0.6: Improving Steiner Trees of a Network Under Multiple Constraints .. - Krumke, al. (1997) (Correct)
0.6: Approximation Algorithms for Certain Network Improvement Problems - al. (1998) (Correct)
0.5: Node Weighted Network Upgrade Problems (Extended Abstract) - Krumke, Noltemeier.. (1997) (Correct)
BibTeX entry: (Update)
@inproceedings{ krumke95complexity,
author = "Sven Oliver Krumke and Hartmut Noltemeier and S. S. Ravi and Madhav V. Marathe",
title = "Complexity and Approximability of Certain Bicriteria Location Problems",
booktitle = "Workshop on Graph-Theoretic Concepts in Computer Science",
pages = "73-87",
year = "1995",
url = "citeseer.ist.psu.edu/18047.html" }
Citations (may not include all citations):1254 Computational Geometry: An Introduction (context) - Preparata, Shamos - 1985
572 Computers and Intractability (context) - Garey, Johnson - 1979
108 Improved Non--Approximability Results - Bellare, Sudan - 1994
94 Clustering to Minimize the Maximum Intercluster Distance (context) - Gonzalez - 1985
67 Optimal Algorithms for Approximate Clustering (context) - Feder, Greene - 1988
65 Discrete Location Theory (context) - Mirchandani, Francis - 1990
50 Approximations with Minimum Packing Constraint Violation (context) - Lin, Vitter - 1992
47 Bicriteria Network Design Problems - Marathe, Ravi et al. - 1995
47 Bicriteria Network Design problems - Marathe, Ravi et al. - 1993
44 Many birds with one stone: Multi-objective approximation alg.. - Ravi, Marathe et al. - 1993
43 Improved approximation guarantees for minimum-weight k-trees.. - Awerbuch, Azar et al.
40 A Unified Approach to Approximation Algorithms for Bottlenec.. (context) - Hochbaum, Shmoys - 1986
36 Spanning trees short or small - Ravi, Sundaram et al. - 1994
33 minimum spanning tree problem in the plane (context) - Garg, Hochbaum et al.
33 A Constant-Factor Approximation for the k-MST Problem in the.. (context) - Blum, Chalasani et al.
29 nearest neighbor Voronoi diagrams in the plane (context) - Lee - 1982
27 points with Minimum Diameter and Related Problems (context) - Aggarwal, Imai et al. - 1991
19 Location on Networks: Theory and Algorithms (context) - Handler, Mirchandani - 1979
16 Analytical Models for Locating Undesirable Facilities (context) - Erkut, Neuman - 1989
14 Operations Research Letters (context) - Dyer, Frieze et al. - 1985
8 Compact Location Problems - Radhakrishnan, Krumke et al. - 1993
6 Scheduling unrelated parallel machines with costs (context) - Shmoys, Tardos - 1993
6 Approximation Algorithms for Selecting Network Centers (context) - Bar-Ilan, Peleg - 1991
4 Compact Location Problems with Budget and Communication Cons.. - Krumke, Noltemeier et al. - 1995
Documents on the same site (http://www.zib.de/krumke/publications.html): More
Compact Location Problems - Krumke, Marathe, Noltemeier.. (1997) (Correct)
Compact Location Problems (Extended Abstract) - Radhakrishnan, Krumke.. (Correct)
Bicriteria Compact Location Problems - Krumke, Noltemeier, Ravi, Marathe (1995) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC