Two O(Log*k)-approximation algorithms for the asymmetric k−center problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2081, Issue , 2001, Pages 1-14

  Archer, Aaron ^a  

^a Department of Obstetrics Gynecology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; INTEGER PROGRAMMING; LINEAR PROGRAMMING;

APPROXIMATION FACTOR; CENTER PROBLEMS; INTEGRALITY GAPS; K-CENTER PROBLEM; LINEAR PROGRAMMING RELAXATION; TRIANGLE INEQUALITY;

APPROXIMATION ALGORITHMS;

EID: 84947241223     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45535-3_1     Document Type: Conference Paper

References (14)

1. A. Archer, “Inapproximability of the asymmetric facility location and k-median problems,” unpublishedman uscript.
2. M. Charikar and S. Guha, “Improvedcom binatorial algorithms for the facility location and k-median problems,” Proc. 40th Annual IEEE Symp. on Foundations of Computer Science, (1999) 378-388.
3. V. Chvatal, “A greedy heuristic for the set covering problem,” Math. Oper. Res., 4 (1979) 233-235.
4. M. Dyer and A. Frieze, “A simple heuristic for the p-centre problem,” Oper. Res. Lett., 3 (1985) 285-288.
5. D. S. Hochbaum, “Heuristics for the fixedcost median problem,” Math. Prog., 22 (1982) 148-162.
6. D. S. Hochbaum and D. B. Shmoys, “A best possible heuristic for the k-center problem,” Math. Oper. Res. 10 (1985) 180-184.
7. D. S. Hochbaum and D. B. Shmoys, “A unifiedapproac h to approximation algorithms for bottleneck problems,” J. ACM, 33 (1986) 533-550.
8. D. S. Johnson, “Approximation algorithms for combinatorial problems,” J. Computer and System Sciences, 9 (1974) 256-278.
9. J. Kleinberg, Personal communication, November 1999.
10. J.-H. Lin and J. S. Vitter, “Є-approximations with minimum packing constraint violation”, Proc. 24th Annual ACM Symp. on Theory of Computing, (1992) 771-782.
11. L. Lovász, “On the ratio of optimal integral andfractional covers,” Discrete Math., 13 (1975) 383-390.
12. R. O’Donnell, personal communication, June 2000.
13. R. Panigrahy and S. Vishwanathan, “An O(log*n) approximation algorithm for the asymmetric p-center problem,” J. Algorithms, 27 (1998) 259-268.
14. S. Vishwanathan, “An O(log*n) approximation algorithm for the asymmetric pcenter problem,” Proc. 7th Annual ACM-SIAM Symp. on Discrete Algorithms, (1996) 1-5.