{"id":"https://openalex.org/W2155971496","doi":"https://doi.org/10.1007/s00453-016-0160-9","title":"Distribution-Sensitive Construction of the Greedy Spanner","display_name":"Distribution-Sensitive Construction of the Greedy Spanner","publication_year":2016,"publication_date":"2016-05-06","ids":{"openalex":"https://openalex.org/W2155971496","doi":"https://doi.org/10.1007/s00453-016-0160-9","mag":"2155971496"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-016-0160-9","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-016-0160-9","pdf_url":"https://link.springer.com/content/pdf/10.1007%2Fs00453-016-0160-9.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007%2Fs00453-016-0160-9.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5078878646","display_name":"Sander P. A. Alewijnse","orcid":null},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Sander P. A. Alewijnse","raw_affiliation_strings":["Eindhoven University of Technology, Eindhoven, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology, Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5029465893","display_name":"Quirijn W. Bouts","orcid":"https://orcid.org/0000-0002-1101-0904"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Quirijn W. Bouts","raw_affiliation_strings":["Eindhoven University of Technology, Eindhoven, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology, Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5089449584","display_name":"Alex P. ten Brink","orcid":null},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Alex P. ten Brink","raw_affiliation_strings":["Eindhoven University of Technology, Eindhoven, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology, Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5077490455","display_name":"Kevin Buchin","orcid":"https://orcid.org/0000-0002-3022-7877"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Kevin Buchin","raw_affiliation_strings":["Eindhoven University of Technology, Eindhoven, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology, Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5078878646"],"corresponding_institution_ids":["https://openalex.org/I83019370"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":0.9327,"has_fulltext":true,"cited_by_count":7,"citation_normalized_percentile":{"value":0.78176044,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"78","issue":"1","first_page":"209","last_page":"231"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9998999834060669,"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":0.9998999834060669,"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.9965000152587891,"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/T11106","display_name":"Data Management and Algorithms","score":0.9926000237464905,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/spanner","display_name":"Spanner","score":0.8545595407485962},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6667174100875854},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6412749290466309},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6021422147750854},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5478371381759644},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.4746183454990387},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.45410239696502686},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.4478576183319092},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44743743538856506},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.44257721304893494},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2870367467403412},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.26917457580566406},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.10912391543388367}],"concepts":[{"id":"https://openalex.org/C2779585601","wikidata":"https://www.wikidata.org/wiki/Q4049850","display_name":"Spanner","level":2,"score":0.8545595407485962},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6667174100875854},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6412749290466309},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6021422147750854},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5478371381759644},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.4746183454990387},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.45410239696502686},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4478576183319092},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44743743538856506},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.44257721304893494},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2870367467403412},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.26917457580566406},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.10912391543388367},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1007/s00453-016-0160-9","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-016-0160-9","pdf_url":"https://link.springer.com/content/pdf/10.1007%2Fs00453-016-0160-9.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:openaire/8fe96391-23cc-445b-b36f-cd5351085cea","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/8fe96391-23cc-445b-b36f-cd5351085cea","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Alewijnse, S P A, Bouts, Q W, ten Brink, A P & Buchin, K A 2017, 'Distribution-sensitive construction of the greedy spanner', Algorithmica, vol. 78, no. 1, pp. 209-231. https://doi.org/10.1007/s00453-016-0160-9","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.755.8090","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.755.8090","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1401.1085.pdf","raw_type":"text"},{"id":"pmh:oai:pure.tue.nl:publications/8fe96391-23cc-445b-b36f-cd5351085cea","is_oa":true,"landing_page_url":"http://www.scopus.com/inward/record.url?scp=84966297448&partnerID=8YFLogxK","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Alewijnse, S P A, Bouts, Q W, ten Brink, A P & Buchin, K A 2017, 'Distribution-sensitive construction of the greedy spanner', Algorithmica, vol. 78, no. 1, pp. 209-231. https://doi.org/10.1007/s00453-016-0160-9","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:tue:oai:pure.tue.nl:publications/8fe96391-23cc-445b-b36f-cd5351085cea","is_oa":true,"landing_page_url":"https://research.tue.nl/nl/publications/8fe96391-23cc-445b-b36f-cd5351085cea","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithmica, 78(1), 209 - 231. Springer","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1007/s00453-016-0160-9","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-016-0160-9","pdf_url":"https://link.springer.com/content/pdf/10.1007%2Fs00453-016-0160-9.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G629491556","display_name":null,"funder_award_id":"(NWO)","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"},{"id":"https://openalex.org/G6900544221","display_name":null,"funder_award_id":"612.001.207","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"},{"id":"https://openalex.org/G8407736463","display_name":null,"funder_award_id":"639.023.208","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"}],"funders":[{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2155971496.pdf","grobid_xml":"https://content.openalex.org/works/W2155971496.grobid-xml"},"referenced_works_count":34,"referenced_works":["https://openalex.org/W125464309","https://openalex.org/W1489238841","https://openalex.org/W1505970908","https://openalex.org/W1551519020","https://openalex.org/W1576373876","https://openalex.org/W1584948383","https://openalex.org/W1757919228","https://openalex.org/W1967533244","https://openalex.org/W1973157729","https://openalex.org/W2005128841","https://openalex.org/W2008979299","https://openalex.org/W2028747718","https://openalex.org/W2033513442","https://openalex.org/W2039111454","https://openalex.org/W2039879619","https://openalex.org/W2051522939","https://openalex.org/W2063135141","https://openalex.org/W2068790848","https://openalex.org/W2073271991","https://openalex.org/W2076014803","https://openalex.org/W2116314660","https://openalex.org/W2126497992","https://openalex.org/W2139391136","https://openalex.org/W2167366051","https://openalex.org/W2203464362","https://openalex.org/W2401057273","https://openalex.org/W2949151776","https://openalex.org/W2951293453","https://openalex.org/W3021716813","https://openalex.org/W3098722153","https://openalex.org/W3138427988","https://openalex.org/W4236341832","https://openalex.org/W4245082111","https://openalex.org/W4300273322"],"related_works":["https://openalex.org/W2043076786","https://openalex.org/W3021716813","https://openalex.org/W798869695","https://openalex.org/W2029782085","https://openalex.org/W2314909417","https://openalex.org/W4297917653","https://openalex.org/W2155971496","https://openalex.org/W2046347355","https://openalex.org/W4289791830","https://openalex.org/W2951293453"],"abstract_inverted_index":{"The":[0],"greedy":[1,65,227],"spanner":[2,8,66,228],"is":[3],"the":[4,57,64,81,97,112,123,232],"highest":[5],"quality":[6],"geometric":[7,172],"(in":[9],"e.g.":[10],"edge":[11,186],"count":[12],"and":[13,18,76,96,118,137,149],"weight,":[14],"both":[15],"in":[16,24,153,180],"theory":[17],"practice)":[19],"known":[20,29],"to":[21,107,198,251],"be":[22,73],"computable":[23],"polynomial":[25],"time.":[26],"Unfortunately,":[27],"all":[28,116,206],"algorithms":[30],"for":[31,60,144,237],"computing":[32],"it":[33,202,231],"on":[34,45,114,133,165,188,225,240,265],"n":[35,217,258],"points":[36,190,196],"take":[37],"(n":[38],"2":[39,216,219,257],")":[40],"time,":[41],"limiting":[42],"its":[43],"applicability":[44],"large":[46,106],"data":[47,120],"sets.":[48,121,168],"We":[49,101,169,246],"propose":[50],"a":[51,89,128,138,154,158,171],"novel":[52],"algorithm":[53,236,264],"design":[54],"which":[55,179],"uses":[56],"observation":[58],"that":[59,71,174,183],"many":[61,68],"point":[62,135,145,167],"sets,":[63],"has":[67,191,203],"'short'":[69],"edges":[70],"can":[72],"determined":[74,93],"locally":[75],"usually":[77,82],"quickly.":[78],"To":[79],"find":[80],"few":[83],"remaining":[84],"'long'":[85],"edges,":[86],"we":[87,126,163],"use":[88,248],"combination":[90],"of":[91,161,195,208,244],"already":[92],"local":[94,159],"information":[95],"well-separated":[98],"pair":[99],"decomposition.":[100],"give":[102,164,170,252],"experimental":[103],"results":[104],"showing":[105],"massive":[108],"performance":[109],"increases":[110],"over":[111],"state-of-the-art":[113],"nearly":[115],"tests":[117],"reallife":[119],"On":[122],"theoretical":[124],"side":[125],"prove":[127],"near-linear":[129],"expected":[130,222,262],"time":[131,223,235,263],"bound":[132,143,224],"uniform":[134],"sets":[136,146],"near-quadratic":[139],"worst-case":[140],"bound.":[141],"Our":[142],"drawn":[147],"uniformly":[148,266],"independently":[150],"at":[151],"random":[152],"square":[155],"follows":[156],"from":[157],"characterization":[160,211,250],"t-spanners":[162],"such":[166],"property":[173],"holds":[175],"with":[176],"high":[177],"probability,":[178],"turn":[181],"implies":[182],"if":[184],"an":[185,213,253],"set":[187],"these":[189],"t-paths":[192,204],"between":[193,205],"pairs":[194,207],"'close'":[197],"each":[199],"other,":[200],"then":[201],"points.":[209,245],"This":[210],"gives":[212],"O(n":[214],"log":[215,218,220,256,259,260],"n)":[221,261],"our":[226],"algorithm,":[229],"making":[230],"first":[233],"subquadratic":[234],"this":[238,249],"problem":[239],"any":[241],"interesting":[242],"class":[243],"also":[247],"O((n":[254],"+|E|)":[255],"distributed":[267]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}