{"id":"https://openalex.org/W2585630643","doi":"https://doi.org/10.4086/toc.2016.v012a015","title":"","display_name":"","publication_year":2016,"publication_date":"2016-01-01","ids":{"openalex":"https://openalex.org/W2585630643","doi":"https://doi.org/10.4086/toc.2016.v012a015","mag":"2585630643"},"language":"en","primary_location":{"id":"doi:10.4086/toc.2016.v012a015","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2016.v012a015","pdf_url":"http://www.theoryofcomputing.org/articles/v012a015/v012a015.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"http://www.theoryofcomputing.org/articles/v012a015/v012a015.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5043851880","display_name":"Eden Chlamt\u00e1\u010d","orcid":"https://orcid.org/0000-0002-0296-0107"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Eden Chlamtac","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5049161363","display_name":"Michael Dinitz","orcid":"https://orcid.org/0000-0002-2632-966X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Michael Dinitz","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.7024,"has_fulltext":true,"cited_by_count":6,"citation_normalized_percentile":{"value":0.77241042,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"12","issue":"1","first_page":"1","last_page":"29"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"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"}},"topics":[{"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/T12176","display_name":"Optimization and Packing Problems","score":0.9918000102043152,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9905999898910522,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/spanner","display_name":"Spanner","score":0.888115644454956},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7905072569847107},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6974250078201294},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.6900283694267273},{"id":"https://openalex.org/keywords/omega","display_name":"Omega","score":0.6532701253890991},{"id":"https://openalex.org/keywords/hardness-of-approximation","display_name":"Hardness of approximation","score":0.614550769329071},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6095656752586365},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5144517421722412},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5072912573814392},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4373449385166168},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4174354374408722},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.19122129678726196},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.13148263096809387},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.08506298065185547}],"concepts":[{"id":"https://openalex.org/C2779585601","wikidata":"https://www.wikidata.org/wiki/Q4049850","display_name":"Spanner","level":2,"score":0.888115644454956},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7905072569847107},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6974250078201294},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.6900283694267273},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.6532701253890991},{"id":"https://openalex.org/C112955886","wikidata":"https://www.wikidata.org/wiki/Q5656275","display_name":"Hardness of approximation","level":3,"score":0.614550769329071},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6095656752586365},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5144517421722412},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5072912573814392},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4373449385166168},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4174354374408722},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.19122129678726196},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.13148263096809387},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.08506298065185547},{"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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.4086/toc.2016.v012a015","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2016.v012a015","pdf_url":"http://www.theoryofcomputing.org/articles/v012a015/v012a015.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.4086/toc.2016.v012a015","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2016.v012a015","pdf_url":"http://www.theoryofcomputing.org/articles/v012a015/v012a015.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3752371004","display_name":"CRII: AF: New Approaches to Graph Spanners","funder_award_id":"1464239","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6162709055","display_name":null,"funder_award_id":"1002/14","funder_id":"https://openalex.org/F4320322252","funder_display_name":"Israel Science Foundation"},{"id":"https://openalex.org/G8944461051","display_name":"AitF: EXPL: Wide-area Dissemination under Strict Timeliness, Reliability, and Cost Constraints","funder_award_id":"1535887","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320322252","display_name":"Israel Science Foundation","ror":"https://ror.org/04sazxf24"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2585630643.pdf","grobid_xml":"https://content.openalex.org/works/W2585630643.grobid-xml"},"referenced_works_count":31,"referenced_works":["https://openalex.org/W1504741231","https://openalex.org/W1562956125","https://openalex.org/W1725039148","https://openalex.org/W1970259241","https://openalex.org/W1973847820","https://openalex.org/W1997369416","https://openalex.org/W1998721609","https://openalex.org/W2002041206","https://openalex.org/W2004163233","https://openalex.org/W2017280430","https://openalex.org/W2018963243","https://openalex.org/W2019578639","https://openalex.org/W2022092881","https://openalex.org/W2022973561","https://openalex.org/W2044989918","https://openalex.org/W2045446569","https://openalex.org/W2057046770","https://openalex.org/W2057994027","https://openalex.org/W2060054375","https://openalex.org/W2071769989","https://openalex.org/W2099237198","https://openalex.org/W2114585066","https://openalex.org/W2144474663","https://openalex.org/W2146522997","https://openalex.org/W2148352980","https://openalex.org/W2242006561","https://openalex.org/W2401485379","https://openalex.org/W2949600115","https://openalex.org/W4214510568","https://openalex.org/W4226347946","https://openalex.org/W4245082111"],"related_works":["https://openalex.org/W4240054244","https://openalex.org/W2912638782","https://openalex.org/W3035713054","https://openalex.org/W2131810278","https://openalex.org/W2307719096","https://openalex.org/W1561811279","https://openalex.org/W2242006561","https://openalex.org/W2962992394","https://openalex.org/W2486585506","https://openalex.org/W2963411648"],"abstract_inverted_index":{"A":[0],"k-spanner":[1,35],"is":[2,78,98,140,152,160],"a":[3,25,28,34],"subgraph":[4],"in":[5,102],"which":[6],"distances":[7],"are":[8,45],"approximately":[9],"preserved,":[10],"up":[11],"to":[12,64,142,146,155],"some":[13,48],"given":[14],"stretch":[15],"factor":[16],"k.":[17,126],"We":[18],"focus":[19],"on":[20],"the":[21,38,56,62,65,73,85,99,103,111,121,144,150],"following":[22],"problem:":[23],"Given":[24],"graph":[26,151],"and":[27,71,115,136,154],"value":[29],"k,":[30],"can":[31],"we":[32,109,128],"find":[33],"that":[36,138],"minimizes":[37],"maximum":[39,100],"degree?":[40],"While":[41],"reasonably":[42],"strong":[43],"bounds":[44],"known":[46,75],"for":[47,84,120],"spanner":[49],"problems,":[50],"they":[51],"almost":[52],"all":[53],"involve":[54],"minimizing":[55],"total":[57],"number":[58],"of":[59,118,123],"edges.":[60],"Switching":[61],"objective":[63],"degree":[66,101],"introduces":[67],"significant":[68],"new":[69],"challenges,":[70],"currently":[72],"only":[74],"approximation":[76,119],"bound":[77],"an":[79,130],"O(":[80,132],"3-2":[81],"2":[82,91,134],")-approximation":[83,135],"special":[86],"case":[87,122],"when":[88,149,158],"k":[89],"=":[90],"[Chlamt,":[92],"Dinitz,":[93],"Krauthgamer":[94],"FOCS":[95],"2012]":[96],"(where":[97],"input":[104],"graph).":[105],"In":[106],"this":[107],"paper":[108],"give":[110,129],"first":[112],"non-trivial":[113],"algorithm":[114],"polynomial-factor":[116],"hardness":[117],"arbitrary":[124],"constant":[125],"Specifically,":[127],"LP-based":[131],"(1-1/k)":[133],"prove":[137],"it":[139,159],"hard":[141],"approximate":[143],"optimum":[145],"within":[147,156],"(1/k)":[148],"undirected,":[153],"(1)":[157],"directed.":[161]},"counts_by_year":[{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2025-12-17T22:08:43.090829","created_date":"2017-02-10T00:00:00"}