{"id":"https://openalex.org/W7162494747","doi":"https://doi.org/10.4230/lipics.socg.2026.53","title":"Constructing Doppelg\u00e4ngers of Greedy Geometric Spanners in Practice","display_name":"Constructing Doppelg\u00e4ngers of Greedy Geometric Spanners in Practice","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7162494747","doi":"https://doi.org/10.4230/lipics.socg.2026.53"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25859","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2026.53","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2026.53","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5073103152","display_name":"Anirban Ghosh","orcid":"https://orcid.org/0000-0003-0130-5968"},"institutions":[{"id":"https://openalex.org/I11874761","display_name":"University of North Florida","ror":"https://ror.org/01j903a45","country_code":"US","type":"education","lineage":["https://openalex.org/I11874761"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ghosh, Anirban","raw_affiliation_strings":["University of North Florida, Jacksonville, FL, USA"],"raw_orcid":"https://orcid.org/0000-0003-0130-5968","affiliations":[{"raw_affiliation_string":"University of North Florida, Jacksonville, FL, USA","institution_ids":["https://openalex.org/I11874761"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5073103152"],"corresponding_institution_ids":["https://openalex.org/I11874761"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.60493371,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"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/T10719","display_name":"3D Shape Modeling and Analysis","score":0.46790000796318054,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10719","display_name":"3D Shape Modeling and Analysis","score":0.46790000796318054,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10481","display_name":"Computer Graphics and Visualization Techniques","score":0.13670000433921814,"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/T10531","display_name":"Advanced Vision and Imaging","score":0.04490000009536743,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/greedy-algorithm","display_name":"Greedy algorithm","score":0.8564000129699707},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5867999792098999},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.5688999891281128},{"id":"https://openalex.org/keywords/greedy-randomized-adaptive-search-procedure","display_name":"Greedy randomized adaptive search procedure","score":0.5486000180244446},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.508400022983551},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.43700000643730164},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.4262000024318695}],"concepts":[{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.8564000129699707},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5867999792098999},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5688999891281128},{"id":"https://openalex.org/C126221529","wikidata":"https://www.wikidata.org/wiki/Q3116070","display_name":"Greedy randomized adaptive search procedure","level":3,"score":0.5486000180244446},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5228000283241272},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.508400022983551},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4603999853134155},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.43700000643730164},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.4262000024318695},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4235000014305115},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4075999855995178},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.38589999079704285},{"id":"https://openalex.org/C2779585601","wikidata":"https://www.wikidata.org/wiki/Q4049850","display_name":"Spanner","level":2,"score":0.36309999227523804},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3587999939918518},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32850000262260437},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.32179999351501465},{"id":"https://openalex.org/C61797465","wikidata":"https://www.wikidata.org/wiki/Q1188986","display_name":"Term (time)","level":2,"score":0.2721000015735626},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2712000012397766},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.25589999556541443}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:25859","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2026.53","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},{"id":"doi:10.4230/lipics.socg.2026.53","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.socg.2026.53","pdf_url":null,"source":null,"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":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25859","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2026.53","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},"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":{"Greedy":[0],"geometric":[1,30,56],"spanners":[2,57,63,83,91],"are":[3,84],"considered":[4],"to":[5,117,160,175,190],"be":[6],"the":[7,61,88,113,118,143,204],"gold":[8],"standard":[9],"for":[10,28,33,51],"their":[11,22],"near-optimal":[12],"guarantees":[13],"in":[14,64,92,135,162],"terms":[15],"of":[16,36,54,81,107,188,203],"sparsity":[17,197],"and":[18,46,67,74,109,182,198,206],"total":[19],"weight.":[20,199],"However,":[21],"inefficient":[23],"construction":[24],"poses":[25],"significant":[26],"challenges":[27],"large-scale":[29],"networks,":[31],"especially":[32],"low":[34],"values":[35],"stretch":[37],"factors":[38],"(<":[39],"2).":[40],"We":[41],"present":[42],"\u0398-Greedy,":[43],"a":[44,104,126,129,163],"simple":[45],"practical":[47,115,145],"parallel":[48],"algorithm":[49,205],"engineered":[50,211],"constructing":[52],"doppelg\u00e4ngers":[53,80,102],"greedy":[55,62,78,82,90,100,121,146],"that":[58],"empirically":[59],"resemble":[60],"key":[65],"structural":[66],"performance":[68],"metrics,":[69],"including":[70],"average":[71],"degree,":[72,73],"lightness.":[75],"Unlike":[76],"approximate":[77],"spanners,":[79],"almost":[85],"indistinguishable":[86],"from":[87],"actual":[89],"practice.":[93],"In":[94,140,177],"our":[95,210],"experiments,":[96],"\u0398-Greedy":[97,123,157,185],"consistently":[98],"produced":[99],"spanner":[101,147],"across":[103],"broad":[105],"range":[106],"synthetic":[108,181],"real-world":[110,183],"datasets,":[111,184],"offering":[112],"first":[114],"alternative":[116],"computationally":[119],"intensive":[120],"spanners.":[122],"can":[124,158],"construct":[125],"1.1-spanner":[127],"on":[128,180],"128K-element":[130],"uniformly":[131],"distributed":[132],"point":[133,155],"set":[134],"well":[136],"under":[137],"5":[138],"minutes.":[139],"contrast,":[141],"Bucketing,":[142,171],"most":[144],"algorithm,":[148],"takes":[149,173],"around":[150],"3":[151],"hours.":[152],"For":[153,200],"million-sized":[154],"sets,":[156],"run":[159],"completion":[161],"few":[164],"hours,":[165],"making":[166],"it":[167],"much":[168],"faster":[169],"than":[170],"which":[172],"days":[174],"finish.":[176],"extensive":[178],"experiments":[179],"delivered":[186],"speedups":[187],"up":[189],"147x":[191],"over":[192],"Bucketing":[193],"while":[194],"preserving":[195],"greedy-like":[196],"broader":[201],"uses":[202],"reproducibility,":[207],"we":[208],"share":[209],"C++":[212],"code.":[213]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-05-28T00:00:00"}