An approximation algorithm for k-center problem on a convex polygon-Reference-Cited by-同舟云学术

An approximation algorithm for k-center problem on a convex polygon

Published:2012-07-12 Issue:3 Volume:27 Page:504-518
ISSN:1382-6905
Container-title:Journal of Combinatorial Optimization
language:en
Short-container-title:J Comb Optim

Author:

Du Hai,Xu Yinfeng

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications

Link

http://link.springer.com/content/pdf/10.1007/s10878-012-9532-5.pdf

Reference11 articles.

1. Agarwal PK, Guibas LJ, Saxe J, Shor PW (1987) A linear time algorithms for computing the Voronoi diagram of a convex polygon. In: Proceedings of the 19th annual ACM symposium on theory of computing, pp 39–45

2. Agarwal PK, Sharir M, Toledo S (1994) Applications of parametric searching in geometric optimization. J Algorithms 17:292–318

3. Agarwal PK, Sharir M (1998) Efficient algorithms for geometric optimization. ACM Comput Surv 30:412–458

4. Bose P, Toussaint G (1996) Computing the constrained Euclidean, geodesic and link center of a simple polygon with applications. In: Proc of pacific graphics international, pp 102–112

5. Brass P, Knauer C, Na HS, Shin CS (2009) Computing k-centers on a line. CoRR abs/ 0902.3282

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

1. Optimal Algorithms for Covering a Rectangle with Identical Circles;2023 14th International Conference on Computing Communication and Networking Technologies (ICCCNT);2023-07-06

2. Clustering Geometrically-Modeled Points in the Aggregated Uncertainty Model;Fundamenta Informaticae;2022-02-15

3. Two lower-bounding algorithms for the p-center problem in an area;Computational Urban Science;2022-01-24

4. The Polygon Burning Problem;WALCOM: Algorithms and Computation;2022

5. The Euclidean k-supplier problem in IR2;Operations Research Letters;2021-01