Download:
|
by Konstantin Andreev, Charles Garrod, Bruce Maggs, Adam Meyerson
http://reports-archive.adm.cs.cmu.edu/anon/2003/CMU-CS-03-162.ps
Add To MetaCart
Abstract:
We consider the problem of Simultaneous Source Location { selecting locations for sources in a capacitated graph such that a given set of demands can be satised. We give an exact algorithm for trees and show how this can be combined with a result of Racke to give a solution that exceeds edge capacities by at most O(log n log log n), where n is the number of nodes. On graphs of bounded treewidth, we show the problem is still NP-Hard, but we are able to give a PTAS with at most O(1 + ) violation of the capacities, or a (k + 1)-approximation with exact capacities, where k is the treewidth and can be made arbitrarily small. 1
Citations
|
383
|
Some optimal inapproximability results
– H˚astad
|
|
351
|
A threshold of ln n for approximating set cover
– Feige
- 1998
|
|
281
|
Graph minors II: Algorithmic aspects of treewidth
– Robertson, Seymour
- 1986
|
|
207
|
An approximate max-flow min-cut theorems for uniform multicommodity flow problem with applications to approximation algorithms
– Leighton, Rao
- 1988
|
|
190
|
A partial k-arboretum of graphs with bounded treewidth
– BODLAENDER
- 1998
|
|
189
|
Approximation algorithms for facility location problems (extended abstract
– SHMOYS, TARDOS, et al.
- 1997
|
|
113
|
Treewidth: Algorithmic techniques and results
– Bodlaender
- 1997
|
|
105
|
Local search heuristics for k-median and facility location problems
– Arya, Garg, et al.
|
|
84
|
An o(log k) approximate min-cut max-flow theorem and approximation algorithm
– Aumann, Rabani
- 1998
|
|
78
|
Excluded minors, network decomposition, and multicommodity flow
– Klein, Plotkin, et al.
- 1993
|
|
69
|
Approximation algorithms for metric facility location problems
– Mahdian, Ye, et al.
|
|
56
|
Minimizing congestion in general networks
– Räcke
- 2002
|
|
53
|
The importance of being biased
– Dinur, Safra
- 2002
|
|
41
|
Fast algorithms for bit-serial routing on a hypercube
– Aiello, Leighton, et al.
- 1991
|
|
32
|
Optimal oblivious routing in polynomial time
– Azar, Cohen, et al.
- 2003
|
|
32
|
Vertex cover might be hard to approximate to within 2 − ɛ
– Khot, Regev
- 2003
|
|
29
|
A polynomial-time tree decomposition to minimize congestion
– Harrelson, Hildrum, et al.
- 2003
|
|
23
|
A practical algorithm for constructing oblivious routing schemes
– Bienkowski, Korzeniowski, et al.
- 2003
|
|
22
|
An approximate max- min-cut theorem for uniform multicommodity problems with applications to approximation algorithms
– Leighton, Rao
- 1988
|
|
19
|
Facility location with nonuniform hard capacities
– P'al, Tardos, et al.
- 2001
|
|
15
|
and Yuval Rabani. An O(log k) approximate min-cut max-flow theorem and approximation algorithm
– Aumann
- 1998
|
|
7
|
An O(log k) approximate min-cut max- theorem and approximation algorithm
– Aumann, Rabani
- 1998
|
|
5
|
Locating sources to meet flow demands in undirected networks
– Arata, Iwata, et al.
- 2002
|
|
1
|
Locating sources to meet demands in undirected networks
– Arata, Iwata, et al.
|
