{"id":"https://openalex.org/W1987589676","doi":"https://doi.org/10.1137/100808459","title":"Optimal Cover of Points by Disks in a Simple Polygon","display_name":"Optimal Cover of Points by Disks in a Simple Polygon","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W1987589676","doi":"https://doi.org/10.1137/100808459","mag":"1987589676"},"language":"en","primary_location":{"id":"doi:10.1137/100808459","is_oa":false,"landing_page_url":"https://doi.org/10.1137/100808459","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5006699796","display_name":"Haim Kaplan","orcid":"https://orcid.org/0000-0001-9586-8002"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Haim Kaplan","raw_affiliation_strings":["haimk@post.tau.ac.il#TAB#"],"affiliations":[{"raw_affiliation_string":"haimk@post.tau.ac.il#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5104278282","display_name":"Matthew J. Katz","orcid":"https://orcid.org/0000-0002-5971-6746"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Matthew J. Katz","raw_affiliation_strings":["matya@cs.bgu.ac.il and gilamor@cs.bgu.ac.il#TAB#"],"affiliations":[{"raw_affiliation_string":"matya@cs.bgu.ac.il and gilamor@cs.bgu.ac.il#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011784325","display_name":"Gila Morgenstern","orcid":"https://orcid.org/0000-0002-5575-4243"},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Gila Morgenstern","raw_affiliation_strings":["Department of Computer Science, Ben Gurion University, Beer Sheva, Israel"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Ben Gurion University, Beer Sheva, Israel","institution_ids":["https://openalex.org/I124227911"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055296785","display_name":"Micha Sharir","orcid":"https://orcid.org/0000-0002-2541-3763"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Micha Sharir","raw_affiliation_strings":["michas@post.tau.ac.il#TAB#"],"affiliations":[{"raw_affiliation_string":"michas@post.tau.ac.il#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5006699796"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.1954,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.87666906,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"40","issue":"6","first_page":"1647","last_page":"1661"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9977999925613403,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.8676896095275879},{"id":"https://openalex.org/keywords/simple-polygon","display_name":"Simple polygon","score":0.8287991285324097},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7182631492614746},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.7119902968406677},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6282370090484619},{"id":"https://openalex.org/keywords/polygon","display_name":"Polygon (computer graphics)","score":0.5826696157455444},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5593027472496033},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5574199557304382},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.51424640417099},{"id":"https://openalex.org/keywords/set-cover-problem","display_name":"Set cover problem","score":0.5117011070251465},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.47926732897758484},{"id":"https://openalex.org/keywords/annulus","display_name":"Annulus (botany)","score":0.45660072565078735},{"id":"https://openalex.org/keywords/convex-polygon","display_name":"Convex polygon","score":0.4408702850341797},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.35319003462791443},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3393620252609253},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.22710636258125305},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.0946870744228363}],"concepts":[{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.8676896095275879},{"id":"https://openalex.org/C197949415","wikidata":"https://www.wikidata.org/wiki/Q782746","display_name":"Simple polygon","level":3,"score":0.8287991285324097},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7182631492614746},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.7119902968406677},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6282370090484619},{"id":"https://openalex.org/C190694206","wikidata":"https://www.wikidata.org/wiki/Q3276654","display_name":"Polygon (computer graphics)","level":3,"score":0.5826696157455444},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5593027472496033},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5574199557304382},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.51424640417099},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.5117011070251465},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.47926732897758484},{"id":"https://openalex.org/C150936888","wikidata":"https://www.wikidata.org/wiki/Q4769748","display_name":"Annulus (botany)","level":2,"score":0.45660072565078735},{"id":"https://openalex.org/C2780034980","wikidata":"https://www.wikidata.org/wiki/Q3259505","display_name":"Convex polygon","level":3,"score":0.4408702850341797},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35319003462791443},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3393620252609253},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.22710636258125305},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0946870744228363},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C126042441","wikidata":"https://www.wikidata.org/wiki/Q1324888","display_name":"Frame (networking)","level":2,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C59822182","wikidata":"https://www.wikidata.org/wiki/Q441","display_name":"Botany","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/100808459","is_oa":false,"landing_page_url":"https://doi.org/10.1137/100808459","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W1539563432","https://openalex.org/W1968301997","https://openalex.org/W1970504456","https://openalex.org/W1973310391","https://openalex.org/W1973521202","https://openalex.org/W1973540452","https://openalex.org/W1975114110","https://openalex.org/W1978452004","https://openalex.org/W1980092773","https://openalex.org/W2000744043","https://openalex.org/W2006048213","https://openalex.org/W2015795441","https://openalex.org/W2021544892","https://openalex.org/W2022671649","https://openalex.org/W2027277859","https://openalex.org/W2028747718","https://openalex.org/W2048475323","https://openalex.org/W2054505111","https://openalex.org/W2059661411","https://openalex.org/W2061750047","https://openalex.org/W2066239131","https://openalex.org/W2082242399","https://openalex.org/W2097374444","https://openalex.org/W2100961486","https://openalex.org/W2120621946","https://openalex.org/W2126876121","https://openalex.org/W2138222927","https://openalex.org/W2143474538","https://openalex.org/W2163464570","https://openalex.org/W2168192372","https://openalex.org/W2614835259","https://openalex.org/W2624483937"],"related_works":["https://openalex.org/W2608536130","https://openalex.org/W2102467404","https://openalex.org/W2987051945","https://openalex.org/W53644101","https://openalex.org/W2154329468","https://openalex.org/W2389833224","https://openalex.org/W2951545900","https://openalex.org/W2751782575","https://openalex.org/W1993484075","https://openalex.org/W2056884694"],"abstract_inverted_index":{"Let":[0],"P":[1],"be":[2,9],"a":[3,10,24,46,99,105],"simple":[4],"polygon,":[5],"and":[6,76,103],"let":[7],"Q":[8,28,50,95],"set":[11,58],"of":[12,27,49,53,61,74],"points":[13],"in":[14,34,68,80,98],"P.":[15,35,69],"We":[16,36,87],"present":[17,104],"an":[18],"almost-linear":[19],"time":[20],"algorithm":[21,40,108],"for":[22,109],"computing":[23],"minimum":[25,47,91],"cover":[26,48],"by":[29,51],"disks":[30],"that":[31,42,65],"are":[32,66],"contained":[33,67,97],"then":[37],"generalize":[38],"the":[39,90],"so":[41],"it":[43],"can":[44],"compute":[45],"homothets":[52],"any":[54],"fixed":[55],"compact":[56],"convex":[57],"${\\cal":[59],"O}$":[60],"constant":[62],"description":[63],"complexity":[64],"This":[70],"improves":[71],"previous":[72],"results":[73],"Katz":[75],"Morgenstern":[77],"[Lecture":[78],"Notes":[79],"Comput.":[81],"Sci.":[82],"5664,":[83],"2009,":[84],"pp.":[85],"447\u2013458].":[86],"also":[88],"consider":[89],"disk-cover":[92],"problem":[93],"when":[94],"is":[96],"(sufficiently":[100],"narrow)":[101],"annulus":[102],"nearly":[106],"linear":[107],"this":[110],"case,":[111],"too.":[112]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}