An O(log*n) approximation algorithm for the asymmetric p-center problem
- Indian Inst. of Technology, Bombay (India)
The input to the asymmetric p-center problem consists of an integer p and an n x n distance matrix D defined on a vertex set V of size n, where d{sub ij} gives the distance from i to j. The distances are assumed to obey the triangle inequality. For a subset S {improper_subset} V the radius of S is the minimum distance R such that every point in V is at a distance at most R from some point in S. The p-center problem consists of picking a set S {improper_subset} V of size p to minimize the radius. This problem is known to be NP-complete. For the symmetric case, when d{sub ij} = d{sub ji}, approximation algorithms that deliver a solution to within 2 of the optimal are known. David Shmoys, in his article, mentions that nothing was known about the asymmetric case. Rina Panigrahy recently gave a simple O(log n) approximation algorithm. We improve this substantially: our algorithm achieves a factor of 0(log* n).
- OSTI ID:
- 416779
- Report Number(s):
- CONF-960121--
- Country of Publication:
- United States
- Language:
- English
Similar Records
Primal-dual approximation algorithms for the survivable network design problem
Pre-vector variational inequality