{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:33:41Z","timestamp":1760441621724,"version":"3.37.3"},"reference-count":17,"publisher":"World Scientific Pub Co Pte Ltd","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2020,2]]},"abstract":"<jats:p> 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.\u00a027(3) (2014) 504\u2013518]. <\/jats:p>","DOI":"10.1142\/s0129054120500070","type":"journal-article","created":{"date-parts":[[2020,3,9]],"date-time":"2020-03-09T09:17:18Z","timestamp":1583745438000},"page":"275-291","source":"Crossref","is-referenced-by-count":4,"title":["Constrained k-Center Problem on a Convex Polygon"],"prefix":"10.1142","volume":"31","author":[{"given":"Manjanna","family":"Basappa","sequence":"first","affiliation":[{"name":"Computer Science and Engineering, Indian Institute of Information Technology Dharwad, IT Park, Opp. Glass House, Hubli 580029, Karnataka, India"}]},{"given":"Ramesh K.","family":"Jallu","sequence":"additional","affiliation":[{"name":"Advanced Computing and Microelectronics Unit, Indian Statistical Institute, Kolkata 700108, West Bengal, India"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7471-2885","authenticated-orcid":false,"given":"Gautam K.","family":"Das","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Indian Institute of Technology Guwahati, Guwahati 781039, India"}]}],"member":"219","published-online":{"date-parts":[[2020,3,6]]},"reference":[{"key":"S0129054120500070BIB001","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-001-0110-y"},{"key":"S0129054120500070BIB002","doi-asserted-by":"publisher","DOI":"10.1145\/299917.299918"},{"key":"S0129054120500070BIB004","first-page":"102","volume-title":"In Proc. of Pacific Graphics International","author":"Bose P.","year":"1996"},{"key":"S0129054120500070BIB005","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054108005747"},{"key":"S0129054120500070BIB006","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-012-9532-5"},{"key":"S0129054120500070BIB007","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2011.01.008"},{"key":"S0129054120500070BIB008","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62255"},{"key":"S0129054120500070BIB009","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(85)90224-5"},{"volume-title":"Approximation Algorithms for NP-Hard Problems","year":"1995","author":"Hochbaum D.","key":"S0129054120500070BIB010"},{"key":"S0129054120500070BIB011","doi-asserted-by":"publisher","DOI":"10.1287\/moor.10.2.180"},{"key":"S0129054120500070BIB012","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2001.1194"},{"key":"S0129054120500070BIB013","first-page":"17","volume":"15","author":"Hurtado F.","year":"2000","journal-title":"Stud. Locat. Anal."},{"key":"S0129054120500070BIB014","doi-asserted-by":"publisher","DOI":"10.1007\/BF01228511"},{"key":"S0129054120500070BIB015","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-012-9452-4"},{"key":"S0129054120500070BIB016","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44968-X_30"},{"key":"S0129054120500070BIB017","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2007.08.005"},{"key":"S0129054120500070BIB018","doi-asserted-by":"publisher","DOI":"10.1016\/S0966-8349(96)00012-5"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054120500070","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,9]],"date-time":"2020-03-09T09:17:23Z","timestamp":1583745443000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054120500070"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2]]},"references-count":17,"journal-issue":{"issue":"02","published-print":{"date-parts":[[2020,2]]}},"alternative-id":["10.1142\/S0129054120500070"],"URL":"https:\/\/doi.org\/10.1142\/s0129054120500070","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"type":"print","value":"0129-0541"},{"type":"electronic","value":"1793-6373"}],"subject":[],"published":{"date-parts":[[2020,2]]}}}