{"id":"https://openalex.org/W2925520559","doi":"https://doi.org/10.1145/3522588","title":"Network Design for <i>s</i> - <i>t</i> Effective Resistance","display_name":"Network Design for <i>s</i> - <i>t</i> Effective Resistance","publication_year":2022,"publication_date":"2022-03-17","ids":{"openalex":"https://openalex.org/W2925520559","doi":"https://doi.org/10.1145/3522588","mag":"2925520559"},"language":"en","primary_location":{"id":"doi:10.1145/3522588","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3522588","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},"type":"article","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/A5027115290","display_name":"Pak Hay Chan","orcid":null},"institutions":[{"id":"https://openalex.org/I4210148186","display_name":"Google (Canada)","ror":"https://ror.org/04d06q394","country_code":"CA","type":"company","lineage":["https://openalex.org/I1291425158","https://openalex.org/I4210128969","https://openalex.org/I4210148186"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Pak Hay Chan","raw_affiliation_strings":["Google Waterloo, Waterloo, ON, Canada"],"affiliations":[{"raw_affiliation_string":"Google Waterloo, Waterloo, ON, Canada","institution_ids":["https://openalex.org/I4210148186"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5008440961","display_name":"Lap Chi Lau","orcid":null},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Lap Chi Lau","raw_affiliation_strings":["University of Waterloo, Waterloo, ON, Canada"],"affiliations":[{"raw_affiliation_string":"University of Waterloo, Waterloo, ON, Canada","institution_ids":["https://openalex.org/I151746483"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063643701","display_name":"Aaron Schild","orcid":"https://orcid.org/0000-0003-0476-6479"},"institutions":[{"id":"https://openalex.org/I201448701","display_name":"University of Washington","ror":"https://ror.org/00cvxb145","country_code":"US","type":"education","lineage":["https://openalex.org/I201448701"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Aaron Schild","raw_affiliation_strings":["University of Washington, Seattle, WA, USA"],"affiliations":[{"raw_affiliation_string":"University of Washington, Seattle, WA, USA","institution_ids":["https://openalex.org/I201448701"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103373639","display_name":"Sam Chiu-wai Wong","orcid":null},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sam Chiu-Wai Wong","raw_affiliation_strings":["Microsoft Research Redmond, Redmond, WA, USA"],"affiliations":[{"raw_affiliation_string":"Microsoft Research Redmond, Redmond, WA, USA","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101398026","display_name":"Hong Zhou","orcid":"https://orcid.org/0000-0003-0784-4073"},"institutions":[{"id":"https://openalex.org/I80947539","display_name":"Fuzhou University","ror":"https://ror.org/011xvna82","country_code":"CN","type":"education","lineage":["https://openalex.org/I80947539"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Hong Zhou","raw_affiliation_strings":["Fuzhou University, Fuzhou, Fujian, China"],"affiliations":[{"raw_affiliation_string":"Fuzhou University, Fuzhou, Fujian, China","institution_ids":["https://openalex.org/I80947539"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5027115290"],"corresponding_institution_ids":["https://openalex.org/I4210148186"],"apc_list":null,"apc_paid":null,"fwci":0.6087,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.62495964,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"18","issue":"3","first_page":"1","last_page":"45"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10780","display_name":"Reliability and Maintenance Optimization","score":0.9922000169754028,"subfield":{"id":"https://openalex.org/subfields/2213","display_name":"Safety, Risk, Reliability and Quality"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10780","display_name":"Reliability and Maintenance Optimization","score":0.9922000169754028,"subfield":{"id":"https://openalex.org/subfields/2213","display_name":"Safety, Risk, Reliability and Quality"},"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9908000230789185,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9843000173568726,"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/randomized-rounding","display_name":"Randomized rounding","score":0.6382429599761963},{"id":"https://openalex.org/keywords/rounding","display_name":"Rounding","score":0.6333146095275879},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6145853400230408},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.602515459060669},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5020203590393066},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.5017867088317871},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.44754329323768616},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.42750829458236694},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4136934280395508},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3639872670173645},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3532333970069885},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.3003658652305603},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2795560359954834}],"concepts":[{"id":"https://openalex.org/C32029473","wikidata":"https://www.wikidata.org/wiki/Q7292010","display_name":"Randomized rounding","level":3,"score":0.6382429599761963},{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.6333146095275879},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6145853400230408},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.602515459060669},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5020203590393066},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.5017867088317871},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.44754329323768616},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.42750829458236694},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4136934280395508},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3639872670173645},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3532333970069885},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.3003658652305603},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2795560359954834},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3522588","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3522588","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":57,"referenced_works":["https://openalex.org/W1568307856","https://openalex.org/W1582339485","https://openalex.org/W1585256533","https://openalex.org/W1599664487","https://openalex.org/W1601422707","https://openalex.org/W1965562201","https://openalex.org/W1969675191","https://openalex.org/W1976459503","https://openalex.org/W1983193888","https://openalex.org/W1985495277","https://openalex.org/W1986507557","https://openalex.org/W1987717935","https://openalex.org/W1989224473","https://openalex.org/W2001139415","https://openalex.org/W2011823863","https://openalex.org/W2014255080","https://openalex.org/W2019404063","https://openalex.org/W2022092881","https://openalex.org/W2029673229","https://openalex.org/W2048572907","https://openalex.org/W2052687843","https://openalex.org/W2054728000","https://openalex.org/W2059109315","https://openalex.org/W2078394884","https://openalex.org/W2110257828","https://openalex.org/W2116673134","https://openalex.org/W2121085314","https://openalex.org/W2126340073","https://openalex.org/W2130626677","https://openalex.org/W2134711723","https://openalex.org/W2138536745","https://openalex.org/W2146146025","https://openalex.org/W2153441719","https://openalex.org/W2157247984","https://openalex.org/W2160138905","https://openalex.org/W2161190897","https://openalex.org/W2172955861","https://openalex.org/W2174245573","https://openalex.org/W2178196238","https://openalex.org/W2265961706","https://openalex.org/W2768170171","https://openalex.org/W2769899835","https://openalex.org/W2788976390","https://openalex.org/W2962800567","https://openalex.org/W2963693432","https://openalex.org/W2999726870","https://openalex.org/W3011766368","https://openalex.org/W3034544338","https://openalex.org/W3106163788","https://openalex.org/W3120635787","https://openalex.org/W3170358550","https://openalex.org/W4240054244","https://openalex.org/W4240507476","https://openalex.org/W4241372588","https://openalex.org/W4241600699","https://openalex.org/W4250589301","https://openalex.org/W4389615663"],"related_works":["https://openalex.org/W1798514331","https://openalex.org/W2621909025","https://openalex.org/W1600160158","https://openalex.org/W1991979416","https://openalex.org/W2943947403","https://openalex.org/W4288358858","https://openalex.org/W2499939553","https://openalex.org/W2121638441","https://openalex.org/W2510957839","https://openalex.org/W2925520559"],"abstract_inverted_index":{"We":[0,86,173],"consider":[1],"a":[2,7,37,46,119,135,144,156,166,180,191],"new":[3],"problem":[4,64,72,78,95,107,141],"of":[5,48,139,151,169,202],"designing":[6],"network":[8,84],"with":[9,50,194],"small":[10],"s":[11,58],"-":[12,59],"t":[13,60],"effective":[14,61],"resistance.":[15,62],"In":[16],"this":[17,94],"problem,":[18],"we":[19,103,133],"are":[20],"given":[21],"an":[22,66],"undirected":[23],"graph":[24,189],"G":[25,49],"=":[26],"(V,E)":[27],",":[28,35],"two":[29,123],"designated":[30],"vertices":[31],"s,t":[32],"\u2208":[33],"V":[34],"and":[36,73,79,90,96,110,142,165],"budget":[38],"k":[39,53],".":[40],"The":[41,149],"goal":[42],"is":[43,65,108,114,155,190],"to":[44,55,116,178],"choose":[45],"subgraph":[47],"at":[51],"most":[52],"edges":[54],"minimize":[56],"the":[57,69,74,100,106,111,125,130,140,152,162,170,187,199,203],"This":[63],"interpolation":[67],"between":[68],"shortest":[70],"path":[71],"minimum":[75],"cost":[76],"flow":[77,167],"has":[80],"applications":[81],"in":[82],"electrical":[83],"design.":[85],"present":[87],"several":[88],"algorithmic":[89,131],"hardness":[91,101],"results":[92],"for":[93,206],"its":[97],"variants.":[98],"On":[99,129],"side,":[102,132],"show":[104],"that":[105],"NP-hard,":[109],"weighted":[112],"version":[113],"hard":[115],"approximate":[117],"within":[118],"factor":[120,146],"smaller":[121],"than":[122,198],"assuming":[124],"small-set":[126],"expansion":[127],"conjecture.":[128],"analyze":[134],"convex":[136,204],"programming":[137,177],"relaxation":[138],"design":[143],"constant":[145],"approximation":[147,184,196],"algorithm.":[148],"key":[150],"rounding":[153],"algorithm":[154],"randomized":[157],"path-rounding":[158],"procedure":[159],"based":[160],"on":[161],"optimality":[163],"conditions":[164],"decomposition":[168],"fractional":[171],"solution.":[172],"also":[174],"use":[175],"dynamic":[176],"obtain":[179],"fully":[181],"polynomial":[182],"time":[183],"scheme":[185],"when":[186],"input":[188],"series-parallel":[192],"graph,":[193],"better":[195],"ratio":[197],"integrality":[200],"gap":[201],"program":[205],"these":[207],"graphs.":[208]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}