{"id":"https://openalex.org/W7148507123","doi":"https://doi.org/10.48550/arxiv.2604.00219","title":"Single-Criteria Metric $r$-Dominating Set Problem via Minor-Preserving Support","display_name":"Single-Criteria Metric $r$-Dominating Set Problem via Minor-Preserving Support","publication_year":2026,"publication_date":"2026-03-31","ids":{"openalex":"https://openalex.org/W7148507123","doi":"https://doi.org/10.48550/arxiv.2604.00219"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.00219","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.00219","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2604.00219","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5003987432","display_name":"Reilly Browne","orcid":"https://orcid.org/0000-0003-3725-5245"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Browne, Reilly","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5132820223","display_name":"Hsien-Chih Chang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chang, Hsien-Chih","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5003987432"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.5649999976158142,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.5649999976158142,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.42170000076293945,"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/T10991","display_name":"Game Theory and Voting Systems","score":0.0026000000070780516,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/ball","display_name":"Ball (mathematics)","score":0.7148000001907349},{"id":"https://openalex.org/keywords/voronoi-diagram","display_name":"Voronoi diagram","score":0.6485999822616577},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.529699981212616},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.4438000023365021},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.43529999256134033},{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.4101000130176544},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.4088999927043915},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.36970001459121704}],"concepts":[{"id":"https://openalex.org/C122041747","wikidata":"https://www.wikidata.org/wiki/Q838611","display_name":"Ball (mathematics)","level":2,"score":0.7148000001907349},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7024999856948853},{"id":"https://openalex.org/C24881265","wikidata":"https://www.wikidata.org/wiki/Q757267","display_name":"Voronoi diagram","level":2,"score":0.6485999822616577},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5303000211715698},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.529699981212616},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4645000100135803},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.4438000023365021},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.43529999256134033},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.4101000130176544},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.4088999927043915},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.36970001459121704},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.3659999966621399},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.349700003862381},{"id":"https://openalex.org/C60933471","wikidata":"https://www.wikidata.org/wiki/Q17152964","display_name":"Metric dimension","level":5,"score":0.3240000009536743},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3237000107765198},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.3174000084400177},{"id":"https://openalex.org/C198043062","wikidata":"https://www.wikidata.org/wiki/Q180953","display_name":"Metric space","level":2,"score":0.31619998812675476},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.3127000033855438},{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.3107999861240387},{"id":"https://openalex.org/C136979486","wikidata":"https://www.wikidata.org/wiki/Q773483","display_name":"Existential quantification","level":2,"score":0.3052000105381012},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.288100004196167},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.28610000014305115},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.2825999855995178},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.2773999869823456},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.25859999656677246}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.00219","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.00219","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2604.00219","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.00219","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Given":[0],"an":[1,108],"unweighted":[2],"graph":[3],"$G$,":[4],"the":[5,12,32,61,76,88,103,118,133,138,145,158,168,179,184],"*minimum":[6],"$r$-dominating":[7,33,78,92,109,148],"set":[8,34,79,110,149],"problem*":[9],"asks":[10],"for":[11,75,144,220],"smallest-cardinality":[13],"subset":[14],"$S$":[15],"such":[16],"that":[17,70,123],"every":[18],"vertex":[19,28],"in":[20,29,191],"$G$":[21],"is":[22,48,105,155],"within":[23],"radius":[24],"$r$":[25,47,55,154],"of":[26,111,120,157,171,183,227,246],"some":[27],"$S$.":[30],"While":[31],"problem":[35,80],"on":[36,58,81,150,203,267],"planar":[37,82,151,204],"graphs":[38,205],"admits":[39],"a":[40,129,217,233,243,264],"PTAS":[41,73],"from":[42],"Baker's":[43],"shifting/layering":[44],"technique":[45],"when":[46,54],"constant,":[49],"it":[50],"becomes":[51],"significantly":[52],"harder":[53,89],"can":[56,161],"depend":[57],"$n$.":[59,192],"Under":[60],"Exponential-Time":[62],"Hypothesis,":[63],"Fox-Epstein":[64],"et":[65,173],"al.":[66,174],"[SODA":[67,175],"2019]":[68],"showed":[69],"no":[71],"efficient":[72],"exists":[74],"unbounded":[77],"graphs.":[83],"One":[84],"may":[85],"also":[86],"consider":[87],"*vertex-weighted":[90],"metric":[91,147],"set*,":[93],"where":[94,153],"edges":[95],"have":[96,99],"lengths,":[97],"vertices":[98],"positive":[100],"weights,":[101],"and":[102,160],"goal":[104],"to":[106,117,132,188,211,242,252,255],"find":[107],"minimum":[112],"total":[113],"weight.":[114,135],"This":[115],"led":[116],"development":[119],"*bicriteria*":[121],"algorithms":[122],"allow":[124],"radius-$(1+\\varepsilon)r$":[125],"balls":[126],"while":[127],"achieving":[128],"$1+\\varepsilon$":[130],"approximation":[131],"optimal":[134],"We":[136,236],"establish":[137],"first":[139],"*single-criteria*":[140],"polynomial-time":[141],"$O(1)$-approximation":[142],"algorithm":[143,166],"vertex-weighted":[146],"graphs,":[152],"part":[156],"input":[159],"be":[162,189],"arbitrarily":[163],"large.":[164],"Our":[165],"applies":[167],"quasi-uniformity":[169],"sampling":[170],"Chan":[172],"2012]":[176],"by":[177,263],"bounding":[178],"*shallow":[180],"cell":[181,241],"complexity*":[182],"radius-$r$":[185],"ball":[186,201,223,247],"system":[187],"linear":[190],"Two":[193],"technical":[194],"innovations":[195],"enable":[196],"this:":[197],"1.":[198],"Since":[199],"discrete":[200],"systems":[202,224],"are":[206,261],"neither":[207],"pseudodisks":[208],"nor":[209],"amenable":[210],"standard":[212],"union-complexity":[213],"arguments,":[214],"we":[215,259],"construct":[216],"*support":[218],"graph*":[219],"arbitrary":[221],"distance":[222],"as":[225,232],"contractions":[226],"Voronoi":[228,269],"cells,":[229,257],"with":[230],"sparseness":[231],"byproduct.":[234],"2.":[235],"assign":[237],"each":[238],"depth-($\\geq":[239],"3$)":[240],"unique":[244],"3-tuple":[245],"centers,":[248],"enabling":[249],"Clarkson-Shor":[250],"techniques":[251],"reduce":[253],"counting":[254],"depth-*exactly*-3":[256],"which":[258],"prove":[260],"$O(n)$":[262],"geometric":[265],"argument":[266],"our":[268],"contraction":[270],"support.":[271]},"counts_by_year":[],"updated_date":"2026-04-03T16:44:17.987007","created_date":"2026-04-03T00:00:00"}