Download:
|
by Adam Meyerson, Kamesh Munagala, Serge Plotkin
http://www.andrew.cmu.edu/~jochen/wireless.ps
Add To MetaCart
Abstract:
We consider a variant of the facility location problem with additional interference constraints of the form "not too many facilities can be close to a user". These constraints arise naturally in the placement of wireless access points or base stations. We model the interference in several (increasingly complex) ways, and show approximation algorithms for them. We also consider the assignment of frequencies to the facilities with the motivation that two facilities with dierent frequencies do not interfere. This leads to an interesting coloring variant of facility location. Our techniques show that interference constraints are not too hard to enforce in rounding schemes that preserve locality.
Citations
|
1375
|
Randomized Algorithms
– Motwani, Raghavan
- 1995
|
|
259
|
Randomized rounding: a technique for provably good algorithms and algorithmic proofs
– Raghavan, Thompson
- 1987
|
|
243
|
Primal-dual approximation algorithms for metric facility location and k-median problems
– Jain, Vazirani
- 1999
|
|
176
|
Improved combinatorial algorithms for the facility location and k-median problems
– Charikar, Guha
- 1999
|
|
166
|
Channel assignment schemes for cellular mobile telecommunication systems: A comprehensive survey
– Katzela, Naghshineh
- 1996
|
|
158
|
Greedy strikes back: Improved facility location algorithms
– Guha, Khuller
- 1998
|
|
121
|
Local search heuristics for k-median and facility location problems
– Arya, Garg, et al.
- 2001
|
|
117
|
Analysis of a local search heuristic for facility location problems
– Korupolu, Plaxton, et al.
- 1998
|
|
81
|
approximations with minimum packing constraint violation
– Lin, Vitter
- 1992
|
|
65
|
Improved approximation algorithms for capacitated facility location problems
– Chudak, Shmoys
- 1999
|
|
54
|
Provisioning a virtual private network: A network design problem for multicommodity flow
– Gupta, Kleinberg, et al.
- 2001
|
|
48
|
Building Steiner trees with incomplete global knowledge
– Karger, Minkoff
- 2000
|
|
36
|
On decomposition of graphs
– Lovász
- 1966
|
|
33
|
Approximation algorithms for channel assignment in radio networks
– Krumke, Marathe, et al.
- 1998
|
|
32
|
Approximating min-sum k-clustering in metric spaces
– Bartal, Charikar, et al.
- 2001
|
|
25
|
A heuristic for the p-center problem in graphs
– Plesnik
- 1987
|
|
24
|
Facility Location with Nonuniform Hard Capacities
– Pál, Tardos, et al.
- 2001
|
|
8
|
Web caching using access statistics
– Meyerson, Munagala, et al.
- 2001
|
