Constrained k-Center Problem on a Convex Polygon-Reference-Cited by-同舟云学术

Constrained k-Center Problem on a Convex Polygon

Published:2020-02 Issue:02 Volume:31 Page:275-291
ISSN:0129-0541
Container-title:International Journal of Foundations of Computer Science
language:en
Short-container-title:Int. J. Found. Comput. Sci.

Author:

Basappa Manjanna¹,Jallu Ramesh K.²,Das Gautam K.³^ORCID

Affiliation:

1. Computer Science and Engineering, Indian Institute of Information Technology Dharwad, IT Park, Opp. Glass House, Hubli 580029, Karnataka, India

2. Advanced Computing and Microelectronics Unit, Indian Statistical Institute, Kolkata 700108, West Bengal, India

3. Department of Mathematics, Indian Institute of Technology Guwahati, Guwahati 781039, India

Abstract

In this paper, we consider a restricted covering problem, in which a convex polygon [Formula: see text] with [Formula: see text] vertices and an integer [Formula: see text] are given, the objective is to cover the entire region of [Formula: see text] using [Formula: see text] congruent disks of minimum radius [Formula: see text], centered on the boundary of [Formula: see text]. For [Formula: see text] and any [Formula: see text], we propose an [Formula: see text]-factor approximation algorithm for this problem, which runs in [Formula: see text] time. The best known approximation factor of the algorithm for the problem in the literature is 1.8841 [H. Du and Y. Xu: An approximation algorithm for [Formula: see text]-center problem on a convex polygon, J. Comb. Optim. 27(3) (2014) 504–518].

Publisher

World Scientific Pub Co Pte Lt

Subject

Computer Science (miscellaneous)

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0129054120500070

Reference17 articles.

1. Exact and Approximation Algorithms for Clustering

2. Efficient algorithms for geometric optimization

3. VARIATIONS OF BASE-STATION PLACEMENT PROBLEM ON THE BOUNDARY OF A CONVEX REGION

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

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

1. Covering convex polygons by two congruent disks;Computational Geometry;2023-02

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

3. Covering Convex Polygons by Two Congruent Disks;Lecture Notes in Computer Science;2021