{"id":"https://openalex.org/W2116314660","doi":"https://doi.org/10.1145/2582112.2582154","title":"A Framework for Computing the Greedy Spanner","display_name":"A Framework for Computing the Greedy Spanner","publication_year":2014,"publication_date":"2014-05-02","ids":{"openalex":"https://openalex.org/W2116314660","doi":"https://doi.org/10.1145/2582112.2582154","mag":"2116314660"},"language":"en","primary_location":{"id":"doi:10.1145/2582112.2582154","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2582112.2582154","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the thirtieth annual symposium on Computational geometry","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://pure.tue.nl/ws/files/91000274/framework_greedy_spanner_authorfinal.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","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":["Department of Mathematics and Computer Science, TU Eindhoven, Eindhoven, The Netherlands","Department of Mathematics and Computer Science, TU Eindhoven, Eindhoven, the Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, TU Eindhoven, Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]},{"raw_affiliation_string":"Department of Mathematics and Computer Science, TU Eindhoven, 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":["Department of Mathematics and Computer Science, TU Eindhoven, Eindhoven, The Netherlands","Department of Mathematics and Computer Science, TU Eindhoven, Eindhoven, the Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, TU Eindhoven, Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]},{"raw_affiliation_string":"Department of Mathematics and Computer Science, TU Eindhoven, 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":["Department of Mathematics and Computer Science, TU Eindhoven, Eindhoven, The Netherlands","Department of Mathematics and Computer Science, TU Eindhoven, Eindhoven, the Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, TU Eindhoven, Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]},{"raw_affiliation_string":"Department of Mathematics and Computer Science, TU Eindhoven, Eindhoven, the Netherlands","institution_ids":["https://openalex.org/I83019370"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I83019370"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":7,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"11","last_page":"19"},"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.9970999956130981,"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.996399998664856,"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.8861826658248901},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.6853745579719543},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5722881555557251},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5479927659034729},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.5217540860176086},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4865044951438904},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4788675010204315},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.460866779088974},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.41703081130981445},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3732864260673523},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3515530228614807},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3296359181404114},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.15032896399497986},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09355157613754272},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.07813534140586853}],"concepts":[{"id":"https://openalex.org/C2779585601","wikidata":"https://www.wikidata.org/wiki/Q4049850","display_name":"Spanner","level":2,"score":0.8861826658248901},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.6853745579719543},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5722881555557251},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5479927659034729},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.5217540860176086},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4865044951438904},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4788675010204315},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.460866779088974},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.41703081130981445},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3732864260673523},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3515530228614807},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3296359181404114},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.15032896399497986},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09355157613754272},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.07813534140586853}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1145/2582112.2582154","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2582112.2582154","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the thirtieth annual symposium on Computational geometry","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.tue.nl:publications/68b2e48e-95f4-4c68-96f8-a4e083f311ca","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/68b2e48e-95f4-4c68-96f8-a4e083f311ca","pdf_url":"https://pure.tue.nl/ws/files/91000274/framework_greedy_spanner_authorfinal.pdf","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":"Bouts, Q W, Brink, ten, A P & Buchin, K 2014, A framework for computing the greedy spanner. in 30th ACM Symposium on Computational Geometry (SoCG, Kyoto, Japan, June 8-11, 2014). Association for Computing Machinery, Inc., New York NY, pp. 11-19, 30th Annual Symposium on Computational Geometry (SoCG 2014), Kyoto, Japan, 8/06/14. https://doi.org/10.1145/2582112.2582154","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:tue:oai:pure.tue.nl:publications/68b2e48e-95f4-4c68-96f8-a4e083f311ca","is_oa":true,"landing_page_url":"https://research.tue.nl/nl/publications/68b2e48e-95f4-4c68-96f8-a4e083f311ca","pdf_url":"https://research.tue.nl/nl/publications/68b2e48e-95f4-4c68-96f8-a4e083f311ca","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":"30th ACM Symposium on Computational Geometry (SoCG, Kyoto, Japan, June 8-11, 2014), 11 - 19","raw_type":"info:eu-repo/semantics/conferencepaper"},{"id":"pmh:771697","is_oa":false,"landing_page_url":"http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=771697","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":null},{"id":"pmh:oai:library.tue.nl:771697","is_oa":false,"landing_page_url":"http://repository.tue.nl/771697","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":null}],"best_oa_location":{"id":"pmh:oai:pure.tue.nl:publications/68b2e48e-95f4-4c68-96f8-a4e083f311ca","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/68b2e48e-95f4-4c68-96f8-a4e083f311ca","pdf_url":"https://pure.tue.nl/ws/files/91000274/framework_greedy_spanner_authorfinal.pdf","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":"Bouts, Q W, Brink, ten, A P & Buchin, K 2014, A framework for computing the greedy spanner. in 30th ACM Symposium on Computational Geometry (SoCG, Kyoto, Japan, June 8-11, 2014). Association for Computing Machinery, Inc., New York NY, pp. 11-19, 30th Annual Symposium on Computational Geometry (SoCG 2014), Kyoto, Japan, 8/06/14. https://doi.org/10.1145/2582112.2582154","raw_type":"info:eu-repo/semantics/conferenceObject"},"sustainable_development_goals":[],"awards":[],"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/W2116314660.pdf","grobid_xml":"https://content.openalex.org/works/W2116314660.grobid-xml"},"referenced_works_count":14,"referenced_works":["https://openalex.org/W125464309","https://openalex.org/W1505970908","https://openalex.org/W2054011861","https://openalex.org/W2067110987","https://openalex.org/W2073271991","https://openalex.org/W2139391136","https://openalex.org/W2167366051","https://openalex.org/W2180566952","https://openalex.org/W2401057273","https://openalex.org/W3021716813","https://openalex.org/W4245082111","https://openalex.org/W4300273322","https://openalex.org/W6678967477","https://openalex.org/W6712937670"],"related_works":["https://openalex.org/W1969798922","https://openalex.org/W2593488756","https://openalex.org/W2759052040","https://openalex.org/W4287999588","https://openalex.org/W2993304180","https://openalex.org/W3082881870","https://openalex.org/W2113270940","https://openalex.org/W2521054645","https://openalex.org/W4389820491","https://openalex.org/W2018076478"],"abstract_inverted_index":{"The":[0,28],"highest":[1],"quality":[2],"geometric":[3],"spanner":[4,33],"(e.g.":[5],"in":[6,12,15,21,30,64,74],"terms":[7],"of":[8],"edge":[9],"count,":[10],"both":[11],"theory":[13],"and":[14,43,68],"practice)":[16],"known":[17],"to":[18,77],"be":[19],"computable":[20],"polynomial":[22],"time":[23,63],"is":[24],"the":[25,55,65],"greedy":[26],"spanner.":[27],"state-of-the-art":[29],"computing":[31],"this":[32],"are":[34],"a":[35,44,78],"O(n2":[36,45],"log":[37,61],"n)":[38,47,62],"time,":[39,48],"O(n2)":[40,69],"space":[41,50,70],"algorithm":[42],"log2":[46],"O(n)":[49],"algorithm,":[51,58],"as":[52,54],"well":[53],"'improved":[56],"greedy'":[57],"taking":[59],"O(n3":[60],"worst":[66],"case":[67],"but":[71],"being":[72],"faster":[73],"practice":[75],"thanks":[76],"caching":[79],"strategy.":[80]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":4}],"updated_date":"2026-07-17T09:13:05.818461","created_date":"2025-10-10T00:00:00"}