{"id":"https://openalex.org/W2181992650","doi":"https://doi.org/10.1137/14099317x","title":"Quasi-Polynomial Time Approximation Scheme for Weighted Geometric Set Cover on Pseudodisks and Halfspaces","display_name":"Quasi-Polynomial Time Approximation Scheme for Weighted Geometric Set Cover on Pseudodisks and Halfspaces","publication_year":2015,"publication_date":"2015-01-01","ids":{"openalex":"https://openalex.org/W2181992650","doi":"https://doi.org/10.1137/14099317x","mag":"2181992650"},"language":"en","primary_location":{"id":"doi:10.1137/14099317x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/14099317x","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/A5051793571","display_name":"Nabil H. Mustafa","orcid":"https://orcid.org/0000-0003-1046-6157"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Nabil H. Mustafa","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5108123578","display_name":"Rajiv Raman","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rajiv Raman","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5111453426","display_name":"Saurabh Ray","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Saurabh Ray","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5051793571"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.4536,"has_fulltext":false,"cited_by_count":36,"citation_normalized_percentile":{"value":0.89785159,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"44","issue":"6","first_page":"1650","last_page":"1669"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998000264167786,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9995999932289124,"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/T12288","display_name":"Optimization and Search Problems","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/mathematics","display_name":"Mathematics","score":0.6502965688705444},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5854213237762451},{"id":"https://openalex.org/keywords/set-cover-problem","display_name":"Set cover problem","score":0.5819061994552612},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.5545385479927063},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.536408007144928},{"id":"https://openalex.org/keywords/dominating-set","display_name":"Dominating set","score":0.48507967591285706},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4594389796257019},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4398178458213806},{"id":"https://openalex.org/keywords/dtime","display_name":"DTIME","score":0.4131605625152588},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3734986186027527},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.3222491145133972},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.27034157514572144},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2437899112701416},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.21057552099227905},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.1605791449546814},{"id":"https://openalex.org/keywords/universal-turing-machine","display_name":"Universal Turing machine","score":0.10431921482086182}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6502965688705444},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5854213237762451},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.5819061994552612},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.5545385479927063},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.536408007144928},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.48507967591285706},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4594389796257019},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4398178458213806},{"id":"https://openalex.org/C15547884","wikidata":"https://www.wikidata.org/wiki/Q1155831","display_name":"DTIME","level":5,"score":0.4131605625152588},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3734986186027527},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.3222491145133972},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.27034157514572144},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2437899112701416},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.21057552099227905},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.1605791449546814},{"id":"https://openalex.org/C131671149","wikidata":"https://www.wikidata.org/wiki/Q2703890","display_name":"Universal Turing machine","level":4,"score":0.10431921482086182},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/14099317x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/14099317x","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":30,"referenced_works":["https://openalex.org/W197042591","https://openalex.org/W1498323793","https://openalex.org/W1531964914","https://openalex.org/W1579969213","https://openalex.org/W1870040444","https://openalex.org/W1924557110","https://openalex.org/W1977333786","https://openalex.org/W1986685589","https://openalex.org/W1992800043","https://openalex.org/W1998375208","https://openalex.org/W1999396007","https://openalex.org/W2001663593","https://openalex.org/W2003159902","https://openalex.org/W2018541722","https://openalex.org/W2021544892","https://openalex.org/W2030279496","https://openalex.org/W2030479143","https://openalex.org/W2039079162","https://openalex.org/W2049413646","https://openalex.org/W2054459484","https://openalex.org/W2064561047","https://openalex.org/W2099819831","https://openalex.org/W2124937241","https://openalex.org/W2138222927","https://openalex.org/W2154952480","https://openalex.org/W2169416073","https://openalex.org/W2170868276","https://openalex.org/W2171261418","https://openalex.org/W2185316375","https://openalex.org/W2993416013"],"related_works":["https://openalex.org/W1702487489","https://openalex.org/W2086025566","https://openalex.org/W4221042980","https://openalex.org/W2383959219","https://openalex.org/W2054473698","https://openalex.org/W2147086810","https://openalex.org/W904840816","https://openalex.org/W2122455640","https://openalex.org/W2927131326","https://openalex.org/W4376639562"],"abstract_inverted_index":{"Weighted":[0],"geometric":[1,8,35,53,247],"set-cover":[2,54,248],"problems":[3,32,217],"arise":[4],"naturally":[5],"in":[6,46,71,150],"several":[7],"and":[9,17,183,231],"nongeometric":[10],"settings":[11],"(e.g.,":[12],"the":[13,48,72,113,178,213,226,241],"breakthrough":[14],"of":[15,20,29,42,68,79,83,102,126,137,181,186,192,207,229],"Bansal":[16],"Pruhs":[18],"[Proceedings":[19,82,101,185],"FOCS,":[21,187],"2010,":[22,85],"pp.":[23,86,105,189,195,237],"407--414]":[24],"reduces":[25],"a":[26,77,89,116,123,154,164,200,203],"wide":[27],"class":[28,125],"machine":[30],"scheduling":[31],"to":[33],"weighted":[34,69,148,204],"set":[36,206],"cover).":[37],"More":[38],"than":[39],"two":[40],"decades":[41],"research":[43],"has":[44],"succeeded":[45],"settling":[47],"$(1+\\epsilon)$-approximability":[49],"status":[50,243],"for":[51,57,74,112,122,152,168,202,244],"most":[52],"problems,":[55],"except":[56],"some":[58],"basic":[59],"scenarios":[60],"which":[61,93,153],"are":[62,175,218],"still":[63],"lacking.":[64,158],"One":[65],"is":[66,141,147,156],"that":[67,215],"disks":[70],"plane":[73],"which,":[75],"after":[76],"series":[78],"papers,":[80],"Varadarajan":[81],"STOC'10,":[84],"641--648]":[87],"presented":[88],"clever":[90],"quasi-sampling":[91],"technique,":[92],"together":[94],"with":[95,225],"improvements":[96],"by":[97],"Chan":[98,230],"et":[99],"al.":[100],"SODA,":[103,193],"2012,":[104],"1576--1585],":[106],"yielded":[107],"an":[108],"$O(1)$-approximation":[109],"algorithm.":[110],"Even":[111],"unweighted":[114],"case,":[115],"polynomial":[117],"time":[118],"approximation":[119],"scheme":[120],"(PTAS)":[121],"fundamental":[124,145],"objects":[127],"called":[128],"pseudodisks":[129],"(which":[130],"includes":[131],"halfspaces,":[132],"disks,":[133],"unit-height":[134],"rectangles,":[135],"translates":[136],"convex":[138],"sets,":[139],"etc.)":[140],"currently":[142,157],"unknown.":[143],"Another":[144],"case":[146],"halfspaces":[149],"$\\mathfrak{R}^3$,":[151],"PTAS":[155,166],"In":[159],"this":[160,239],"paper,":[161],"we":[162],"present":[163],"quasi":[165],"(QPTAS)":[167],"all":[169,245],"these":[170,216],"remaining":[171],"problems.":[172,249],"Our":[173],"results":[174],"based":[176],"on":[177],"separator":[179],"framework":[180],"Adamaszek":[182],"Wiese":[184],"2013,":[188],"400--409;":[190],"Proceedings":[191],"2014,":[194],"645--656],":[196],"who":[197],"recently":[198],"obtained":[199],"QPTAS":[201],"independent":[205],"polygonal":[208],"regions.":[209],"This":[210],"rules":[211],"out":[212],"possibility":[214],"APX-hard,":[219],"assuming":[220],"${NP}":[221],"\\not\\subseteq":[222],"{DTIME}(2^{polylog(n)})$.":[223],"Together":[224],"recent":[227],"work":[228],"Grant":[232],"[Comput.":[233],"Geom.,":[234],"47":[235],"(2014),":[236],"112--124],":[238],"settles":[240],"APX-hardness":[242],"natural":[246]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}