Complexity and approximability of certain bicriteria location problems
- Wuerzburg Univ. (Germany)
- State Univ. of New York, Albany, NY (United States)
- Los Alamos National Lab., NM (United States)
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 distributed systems. We show that, in general, obtaining placements that are near-optimal with respect to the first distance metric is NP-hard even when we allow the budget constraint on the second distance metric to be violated by a constant factor. However, when both the distance metrics satisfy the triangle inequality, we present approximation algorithms that produce placements which are near-optimal with respect to the first distance metric while violating the budget constraint only by a small constant factor. We also present polynomial algorithms for these problems when the underlying graph is a tree.
- Research Organization:
- Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
- Sponsoring Organization:
- USDOE, Washington, DC (United States)
- DOE Contract Number:
- W-7405-ENG-36
- OSTI ID:
- 125167
- Report Number(s):
- LA-UR-95-3349; CONF-960141-1; ON: DE96001382
- Resource Relation:
- Conference: International workshop on graph theoretic concepts, Aachen (Germany), Jan 1996; Other Information: PBD: [1995]
- Country of Publication:
- United States
- Language:
- English
Similar Records
Compact location problems with budget and communication constraints
On optimal strategies for upgrading networks