{"id":"https://openalex.org/W2060054375","doi":"https://doi.org/10.1145/1993636.1993680","title":"Directed spanners via flow-based linear programs","display_name":"Directed spanners via flow-based linear programs","publication_year":2011,"publication_date":"2011-06-06","ids":{"openalex":"https://openalex.org/W2060054375","doi":"https://doi.org/10.1145/1993636.1993680","mag":"2060054375"},"language":"en","primary_location":{"id":"doi:10.1145/1993636.1993680","is_oa":true,"landing_page_url":"https://doi.org/10.1145/1993636.1993680","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/1993636.1993680","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-third annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/1993636.1993680","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5049161363","display_name":"Michael Dinitz","orcid":"https://orcid.org/0000-0002-2632-966X"},"institutions":[{"id":"https://openalex.org/I53964585","display_name":"Weizmann Institute of Science","ror":"https://ror.org/0316ej306","country_code":"IL","type":"education","lineage":["https://openalex.org/I53964585"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Michael Dinitz","raw_affiliation_strings":["Weizmann Institute of Science, Rehovot, Israel"],"affiliations":[{"raw_affiliation_string":"Weizmann Institute of Science, Rehovot, Israel","institution_ids":["https://openalex.org/I53964585"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5037378898","display_name":"Robert Krauthgamer","orcid":"https://orcid.org/0009-0003-8154-3735"},"institutions":[{"id":"https://openalex.org/I53964585","display_name":"Weizmann Institute of Science","ror":"https://ror.org/0316ej306","country_code":"IL","type":"education","lineage":["https://openalex.org/I53964585"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Robert Krauthgamer","raw_affiliation_strings":["Weizmann Institute of Science, Rehovot, Israel"],"affiliations":[{"raw_affiliation_string":"Weizmann Institute of Science, Rehovot, Israel","institution_ids":["https://openalex.org/I53964585"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5049161363"],"corresponding_institution_ids":["https://openalex.org/I53964585"],"apc_list":null,"apc_paid":null,"fwci":2.9082,"has_fulltext":false,"cited_by_count":28,"citation_normalized_percentile":{"value":0.9082995,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"323","last_page":"332"},"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.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/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/T10374","display_name":"Advanced Graph Theory Research","score":0.9993000030517578,"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/T12288","display_name":"Optimization and Search Problems","score":0.9988999962806702,"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/rounding","display_name":"Rounding","score":0.7678314447402954},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6988639831542969},{"id":"https://openalex.org/keywords/sublinear-function","display_name":"Sublinear function","score":0.6762498021125793},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5288870334625244},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4836617410182953},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.46730801463127136},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.45908987522125244},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.45731422305107117},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.45052653551101685},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.44832342863082886},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.44090506434440613},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.43751060962677},{"id":"https://openalex.org/keywords/randomized-rounding","display_name":"Randomized rounding","score":0.4344737231731415},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.43175333738327026},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.43138909339904785}],"concepts":[{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.7678314447402954},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6988639831542969},{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.6762498021125793},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5288870334625244},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4836617410182953},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.46730801463127136},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.45908987522125244},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.45731422305107117},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.45052653551101685},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.44832342863082886},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44090506434440613},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.43751060962677},{"id":"https://openalex.org/C32029473","wikidata":"https://www.wikidata.org/wiki/Q7292010","display_name":"Randomized rounding","level":3,"score":0.4344737231731415},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43175333738327026},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.43138909339904785},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1993636.1993680","is_oa":true,"landing_page_url":"https://doi.org/10.1145/1993636.1993680","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/1993636.1993680","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-third annual ACM symposium on Theory of computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/1993636.1993680","is_oa":true,"landing_page_url":"https://doi.org/10.1145/1993636.1993680","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/1993636.1993680","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-third annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7336693576","display_name":null,"funder_award_id":"#452/08","funder_id":"https://openalex.org/F4320322252","funder_display_name":"Israel Science Foundation"},{"id":"https://openalex.org/G8240595191","display_name":null,"funder_award_id":"452/08","funder_id":"https://openalex.org/F4320322252","funder_display_name":"Israel Science Foundation"}],"funders":[{"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/W2060054375.pdf","grobid_xml":"https://content.openalex.org/works/W2060054375.grobid-xml"},"referenced_works_count":28,"referenced_works":["https://openalex.org/W1534368076","https://openalex.org/W1565009874","https://openalex.org/W1989274820","https://openalex.org/W1996879666","https://openalex.org/W1997369416","https://openalex.org/W1998721609","https://openalex.org/W2002041206","https://openalex.org/W2018956470","https://openalex.org/W2022092881","https://openalex.org/W2022191808","https://openalex.org/W2044989918","https://openalex.org/W2045107949","https://openalex.org/W2045446569","https://openalex.org/W2057046770","https://openalex.org/W2060054375","https://openalex.org/W2068871408","https://openalex.org/W2074117023","https://openalex.org/W2108967854","https://openalex.org/W2120358419","https://openalex.org/W2121615984","https://openalex.org/W2130626677","https://openalex.org/W2146522997","https://openalex.org/W2296148711","https://openalex.org/W2496163386","https://openalex.org/W2569942321","https://openalex.org/W2952355260","https://openalex.org/W4245082111","https://openalex.org/W4248550452"],"related_works":["https://openalex.org/W2268207117","https://openalex.org/W3100114454","https://openalex.org/W2561769964","https://openalex.org/W2507810539","https://openalex.org/W2117839333","https://openalex.org/W2035016254","https://openalex.org/W1966079129","https://openalex.org/W1991979416","https://openalex.org/W2053393096","https://openalex.org/W276709744"],"abstract_inverted_index":{"We":[0,9,108,186],"examine":[1],"directed":[2,16],"spanners":[3],"through":[4],"flow-based":[5,145],"linear":[6],"programming":[7],"relaxations.":[8],"design":[10,64,166],"an":[11,69,80,105],"~O(n2/3)-approximation":[12],"algorithm":[13,45,67],"for":[14,21,32,120],"the":[15,28,37,48,58,72,94,172,177,194],"k-spanner":[17],"problem":[18],"that":[19,133,170],"works":[20],"all":[22,129],"k":[23,54],"\u2265":[24,55],"1,":[25],"which":[26,97],"is":[27,132,158,164],"first":[29],"sublinear":[30],"approximation":[31,51,106],"arbitrary":[33],"edge-lengths.":[34],"Even":[35],"in":[36],"more":[38],"restricted":[39],"setting":[40],"of":[41,61,77,88,116,128,174,196],"unit":[42],"edge-lengths,":[43],"our":[44,78,89,130],"improves":[46],"over":[47],"previous":[49,73],"~O(n1-1/k)":[50],"[BGJRW09]":[52],"when":[53,155],"4.":[56],"For":[57],"special":[59],"case":[60],"k=3":[62],"we":[63,139],"a":[65,111,141,167],"different":[66],"achieving":[68],"~O(\u221an)-approximation,":[70],"improving":[71],"~O(n2/3)":[74],"[EP05,BGJRW09]":[75],"(independently":[76],"work,":[79],"~O(n1-1/\u2308":[81],"k/2\u2309)":[82],"was":[83],"recently":[84,99],"devised":[85],"[BRR10]).":[86],"Both":[87],"algorithms":[90,131],"easily":[91],"extend":[92],"to":[93,150,165],"fault-tolerant":[95],"setting,":[96],"has":[98],"attracted":[100],"attention":[101],"but":[102],"not":[103,159],"from":[104],"viewpoint.":[107],"also":[109],"prove":[110],"nearly":[112],"matching":[113],"integrality":[114],"gap":[115],"~\u03a9(n1/3":[117],"-":[118],"\u03b5)":[119],"every":[121],"constant":[122],"\u03b5":[123],">":[124],"0.":[125],"A":[126],"virtue":[127],"they":[134],"are":[135],"relatively":[136],"simple.":[137],"Technically,":[138],"introduce":[140],"new":[142],"yet":[143],"natural":[144],"relaxation,":[146],"and":[147],"show":[148],"how":[149],"approximately":[151],"solve":[152],"it":[153],"even":[154],"its":[156],"size":[157],"polynomial.":[160],"The":[161],"main":[162],"challenge":[163],"rounding":[168],"scheme":[169],"\"coordinates\"":[171],"choices":[173],"flow-paths":[175],"between":[176],"many":[178],"demand":[179],"pairs":[180],"while":[181],"using":[182],"few":[183],"edges":[184],"overall.":[185],"achieve":[187],"this,":[188],"roughly":[189],"speaking,":[190],"by":[191],"randomization":[192],"at":[193],"level":[195],"vertices.":[197]},"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":3},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":4}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}