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

Authors:
Hai Du;Yinfeng Xu
Affiliations:
School of Mathematics and Statistics, Xi'an Jiaotong University, Xi'an, P.R. China 710049 and School of Management, Xi'an Jiaotong University, Xi'an, P.R. China 710049 and The State Key Lab for Ma ...;School of Mathematics and Statistics, Xi'an Jiaotong University, Xi'an, P.R. China 710049 and School of Management, Xi'an Jiaotong University, Xi'an, P.R. China 710049 and The State Key Lab for Ma ...
Venue:
Journal of Combinatorial Optimization
Year:
2014

Citing 7
Cited 0

A Linear time algorithm for computing the Voronoi diagram of a convex polygon

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Applications of parametric searching in geometric optimization

SODA selected papers from the third annual ACM-SIAM symposium on Discrete algorithms
Efficient algorithms for geometric optimization

ACM Computing Surveys (CSUR)
The 2-center problem with obstacles

Journal of Algorithms
Efficient Algorithms for Two-Center Problems for a Convex Polygon

COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Computing the Constrained Euclidean Geodesic and Link Center of a Simple Polygon with Applications

CGI '96 Proceedings of the 1996 Conference on Computer Graphics International
Base station placement on boundary of a convex polygon

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper studies the constrained version of the k-center location problem. Given a convex polygonal region, every point in the region originates a service demand. Our objective is to place k facilities lying on the region's boundary, such that every point in that region receives service from its closest facility and the maximum service distance is minimized. This problem is equivalent to covering the polygon by k circles with centers on its boundary which have the smallest possible radius. We present an 1.8841-approximation polynomial time algorithm for this problem.