Two O(log* k)-Approximation Algorithms for the Asymmetric k-Center Problem-Reference-Cited by-同舟云学术

Two O(log* k)-Approximation Algorithms for the Asymmetric k-Center Problem

Published:2001 Issue: Volume: Page:1-14
ISSN:0302-9743
Container-title:Integer Programming and Combinatorial Optimization
language:
Short-container-title:

Author:

Archer Aaron

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-45535-3_1

Reference14 articles.

1. A. Archer, “Inapproximability of the asymmetric facility location and k-median problems,” unpublished manuscript.

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.

Cited by 16 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Max-Min Diversification with Asymmetric Distances;Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining;2024-08-24

2. Min-Max-Min Optimization with Smooth and Strongly Convex Objectives;SIAM Journal on Optimization;2023-09-08

3. Constant-Factor Greedy Algorithms for the Asymmetric p-Center Problem in Parameterized Complete Digraphs;Algorithmic Aspects in Information and Management;2019

4. Client assignment problems for latency minimization;Journal of Combinatorial Optimization;2018-07-14

5. A simple greedy approximation algorithm for the minimum connected $$k$$ k -Center problem;Journal of Combinatorial Optimization;2015-02-03