Author:
Liang Dongyue,Mei Liquan,Willson James,Wang Wei
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications
Reference10 articles.
1. Archer A (2001) Two $$O(log^{*}k)$$ O ( l o g ∗ k ) approximation algorithms for the asymmetric $$k$$ k -Center problem. Integer programming and cambinatorial optimization. Lecture Notes in Computer Science 2081:1–14
2. Bondy JA, Murty SR (1976) Graph theory with applications. Elsevier Science Publishing Co., Inc., New York
3. Chuzhoy J, Guha S, Halperin E, Khama S, Kortsarz G, Krauthgamer R, Naor J (2005) Asymmetric k-Center is $$\log ^* n$$ log ∗ n hard to approximate. J ACM 52(4):538–551
4. Dyer ME, Frieze AM (1985) A simple heuristic for the $$p$$ p -center problem. Oper Res Lett 3(6):285–288
5. Ge R, Ester M, Gao BJ, Hu Z, Bhattacharya B, Ben-Moshe B (2008) Joint cluster analysis of attribute data and delationship data: the connected $$k$$ k -Center problem, algorithms and applications. ACM Trans Knowl Discov Data 2:7
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献