{"id":"https://openalex.org/W2116405248","doi":"https://doi.org/10.1145/1989493.1989526","title":"Sparse spanners vs. compact routing","display_name":"Sparse spanners vs. compact routing","publication_year":2011,"publication_date":"2011-06-04","ids":{"openalex":"https://openalex.org/W2116405248","doi":"https://doi.org/10.1145/1989493.1989526","mag":"2116405248"},"language":"en","primary_location":{"id":"doi:10.1145/1989493.1989526","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1989493.1989526","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures","raw_type":"proceedings-article"},"type":"preprint","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/A5013587418","display_name":"Cyril Gavoille","orcid":"https://orcid.org/0000-0003-3671-8607"},"institutions":[{"id":"https://openalex.org/I15057530","display_name":"Universit\u00e9 de Bordeaux","ror":"https://ror.org/057qpr032","country_code":"FR","type":"education","lineage":["https://openalex.org/I15057530"]},{"id":"https://openalex.org/I4210142254","display_name":"Laboratoire Bordelais de Recherche en Informatique","ror":"https://ror.org/03adqg323","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I15057530","https://openalex.org/I4210142254","https://openalex.org/I4210159245","https://openalex.org/I4210160189"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Cyril Gavoille","raw_affiliation_strings":["LaBRI - Universit\u00e9 de Bordeaux, 33405 Talence cedex, France","Laboratoire Bordelais de Recherche en Informatique","Algorithmics for computationally intensive applications over wide scale distributed platforms"],"affiliations":[{"raw_affiliation_string":"LaBRI - Universit\u00e9 de Bordeaux, 33405 Talence cedex, France","institution_ids":["https://openalex.org/I15057530","https://openalex.org/I4210142254"]},{"raw_affiliation_string":"Laboratoire Bordelais de Recherche en Informatique","institution_ids":["https://openalex.org/I4210142254"]},{"raw_affiliation_string":"Algorithmics for computationally intensive applications over wide scale distributed platforms","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5104781603","display_name":"Christian Sommer","orcid":null},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Christian Sommer","raw_affiliation_strings":["Massachusetts Institute of Technology, Cambridge, MA, USA"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5013587418"],"corresponding_institution_ids":["https://openalex.org/I15057530","https://openalex.org/I4210142254"],"apc_list":null,"apc_paid":null,"fwci":1.9281,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.86155364,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"225","last_page":"234"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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.9998999834060669,"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.9998999834060669,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9968000054359436,"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/routing","display_name":"Routing (electronic design automation)","score":0.6095495820045471},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.5936325192451477},{"id":"https://openalex.org/keywords/multiplicative-function","display_name":"Multiplicative function","score":0.560685396194458},{"id":"https://openalex.org/keywords/multipath-routing","display_name":"Multipath routing","score":0.4930834472179413},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.47054487466812134},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.45390430092811584},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4402744174003601},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4242207407951355},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.41715067625045776},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4157807230949402},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.41566306352615356},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.41376790404319763},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.33201467990875244},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.1672993004322052},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.10529470443725586},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.08337780833244324}],"concepts":[{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.6095495820045471},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.5936325192451477},{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.560685396194458},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.4930834472179413},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.47054487466812134},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.45390430092811584},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4402744174003601},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4242207407951355},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.41715067625045776},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4157807230949402},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.41566306352615356},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.41376790404319763},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.33201467990875244},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1672993004322052},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.10529470443725586},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.08337780833244324},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/1989493.1989526","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1989493.1989526","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.396.6078","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.396.6078","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://dept-info.labri.fr/~gavoille/article/GS11/","raw_type":"text"},{"id":"pmh:oai:HAL:hal-00651836v1","is_oa":false,"landing_page_url":"https://hal.science/hal-00651836","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"$23^{rd}$ Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), Jun 2011, San Jose, United States. pp.225-234, ⟨10.1145/1989493.1989526⟩","raw_type":"Conference papers"},{"id":"pmh:oai:oskar-bordeaux.fr:20.500.12278/197993","is_oa":false,"landing_page_url":"https://oskar-bordeaux.fr/handle/20.500.12278/197993","pdf_url":null,"source":{"id":"https://openalex.org/S4306402569","display_name":"Oskar-Bordeaux (Universite de Bordeaux)","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":"$23^{rd}$ Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA)","raw_type":"Communication dans un congr\u00e8s"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":67,"referenced_works":["https://openalex.org/W1491309030","https://openalex.org/W1492516078","https://openalex.org/W1520984708","https://openalex.org/W1527483699","https://openalex.org/W1532318167","https://openalex.org/W1534484868","https://openalex.org/W1536817373","https://openalex.org/W1578476214","https://openalex.org/W1587867115","https://openalex.org/W1606592022","https://openalex.org/W1607700260","https://openalex.org/W1806052854","https://openalex.org/W1967359086","https://openalex.org/W1971052845","https://openalex.org/W1972920042","https://openalex.org/W1974678299","https://openalex.org/W1982100216","https://openalex.org/W1985636891","https://openalex.org/W1987776185","https://openalex.org/W1997027778","https://openalex.org/W2002041206","https://openalex.org/W2006383304","https://openalex.org/W2007575140","https://openalex.org/W2021636540","https://openalex.org/W2025387541","https://openalex.org/W2030043921","https://openalex.org/W2033698604","https://openalex.org/W2034501275","https://openalex.org/W2035494495","https://openalex.org/W2042333226","https://openalex.org/W2044293370","https://openalex.org/W2045446569","https://openalex.org/W2048177275","https://openalex.org/W2057994027","https://openalex.org/W2061507472","https://openalex.org/W2063048655","https://openalex.org/W2067431706","https://openalex.org/W2070631758","https://openalex.org/W2076164610","https://openalex.org/W2077824753","https://openalex.org/W2082352769","https://openalex.org/W2091569826","https://openalex.org/W2092319564","https://openalex.org/W2096304547","https://openalex.org/W2097747425","https://openalex.org/W2099237198","https://openalex.org/W2101828567","https://openalex.org/W2102465486","https://openalex.org/W2106928775","https://openalex.org/W2119483402","https://openalex.org/W2132877272","https://openalex.org/W2133065816","https://openalex.org/W2140279174","https://openalex.org/W2141663929","https://openalex.org/W2150410057","https://openalex.org/W2153353483","https://openalex.org/W2158663853","https://openalex.org/W2168568667","https://openalex.org/W2169244182","https://openalex.org/W2244611312","https://openalex.org/W2293001982","https://openalex.org/W4245082111","https://openalex.org/W6631222323","https://openalex.org/W6634949362","https://openalex.org/W6639052345","https://openalex.org/W6648252010","https://openalex.org/W6684544777"],"related_works":["https://openalex.org/W2181601090","https://openalex.org/W2108305519","https://openalex.org/W2068473861","https://openalex.org/W1971663816","https://openalex.org/W3127002380","https://openalex.org/W2369989480","https://openalex.org/W2607223747","https://openalex.org/W2124642421","https://openalex.org/W2361465121","https://openalex.org/W2030786877"],"abstract_inverted_index":{"Routing":[0],"with":[1,29,49,61,68],"multiplicative":[2],"stretch":[3,63,70],"3":[4],"(which":[5],"means":[6],"that":[7],"the":[8,12,44],"path":[9],"used":[10],"by":[11],"routing":[13,30,83],"scheme":[14],"can":[15,26,54],"be":[16,27,55],"up":[17],"to":[18,43,57],"three":[19],"times":[20],"longer":[21],"than":[22],"a":[23],"shortest":[24],"path)":[25],"done":[28],"tables":[31],"of":[32,46],"\u0398(\u221an)":[33],"bits":[34],"per":[35],"node.":[36],"The":[37],"space":[38],"lower":[39],"bound":[40],"is":[41],"due":[42],"existence":[45],"dense":[47],"graphs":[48,53],"large":[50],"girth.":[51],"Dense":[52],"sparsified":[56],"subgraphs,":[58],"called":[59],"spanners,":[60],"various":[62],"guarantees.":[64],"There":[65],"are":[66,85],"spanners":[67],"additive":[69,76,82],"guarantees":[71],"(some":[72],"even":[73],"have":[74],"constant":[75],"stretch)":[77],"but":[78],"only":[79],"very":[80],"few":[81],"schemes":[84],"known.":[86]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}