{"id":"https://openalex.org/W2980970890","doi":"https://doi.org/10.1145/3447959","title":"Node-weighted Network Design in Planar and Minor-closed Families of Graphs","display_name":"Node-weighted Network Design in Planar and Minor-closed Families of Graphs","publication_year":2021,"publication_date":"2021-04-30","ids":{"openalex":"https://openalex.org/W2980970890","doi":"https://doi.org/10.1145/3447959","mag":"2980970890"},"language":"en","primary_location":{"id":"doi:10.1145/3447959","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3447959","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3447959","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":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3447959","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5036503505","display_name":"Chandra Chekuri","orcid":"https://orcid.org/0000-0003-3035-1699"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Chandra Chekuri","raw_affiliation_strings":["University of Illinois, IL","University of Illinois (IL)"],"affiliations":[{"raw_affiliation_string":"University of Illinois, IL","institution_ids":["https://openalex.org/I157725225"]},{"raw_affiliation_string":"University of Illinois (IL)","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025907388","display_name":"Alina Ene","orcid":"https://orcid.org/0000-0002-5818-1807"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Alina Ene","raw_affiliation_strings":["Boston University, Boston, MA","Boston University Boston, MA"],"affiliations":[{"raw_affiliation_string":"Boston University, Boston, MA","institution_ids":[]},{"raw_affiliation_string":"Boston University Boston, MA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5052582756","display_name":"Ali Vakilian","orcid":"https://orcid.org/0000-0001-5049-7594"},"institutions":[{"id":"https://openalex.org/I160992636","display_name":"Toyota Technological Institute at Chicago","ror":"https://ror.org/02sn5gb64","country_code":"US","type":"education","lineage":["https://openalex.org/I160992636"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ali Vakilian","raw_affiliation_strings":["Toyota Technological Institute at Chicago (TTIC), Chicago, IL"],"affiliations":[{"raw_affiliation_string":"Toyota Technological Institute at Chicago (TTIC), Chicago, IL","institution_ids":["https://openalex.org/I160992636"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5036503505"],"corresponding_institution_ids":["https://openalex.org/I157725225"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.01124104,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"17","issue":"2","first_page":"1","last_page":"25"},"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.9998000264167786,"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.9998000264167786,"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.9994999766349792,"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.9962000250816345,"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/combinatorics","display_name":"Combinatorics","score":0.7677709460258484},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.574337899684906},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5370617508888245},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.5257281064987183},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5100465416908264},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.5045114755630493},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.49176862835884094},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.4744381010532379},{"id":"https://openalex.org/keywords/minor","display_name":"Minor (academic)","score":0.46491795778274536},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.45434826612472534},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.43539342284202576},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.4220551550388336},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2848008871078491},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.13035663962364197}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7677709460258484},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.574337899684906},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5370617508888245},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.5257281064987183},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5100465416908264},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.5045114755630493},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.49176862835884094},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.4744381010532379},{"id":"https://openalex.org/C2779760435","wikidata":"https://www.wikidata.org/wiki/Q5396169","display_name":"Minor (academic)","level":2,"score":0.46491795778274536},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.45434826612472534},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43539342284202576},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.4220551550388336},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2848008871078491},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.13035663962364197},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","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}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1145/3447959","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3447959","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3447959","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"},{"id":"pmh:oai:arXiv.org:1910.07616","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1910.07616","pdf_url":"https://arxiv.org/pdf/1910.07616","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.299.7167","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.299.7167","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.uiuc.edu/homes/chekuri/papers/planar-node-weighted-sndp-icalp.pdf","raw_type":"text"},{"id":"doi:10.48550/arxiv.1910.07616","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1910.07616","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"},{"id":"mag:2980970890","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"doi:10.1145/3447959","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3447959","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3447959","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"},"sustainable_development_goals":[{"score":0.4300000071525574,"display_name":"Life in Land","id":"https://metadata.un.org/sdg/15"}],"awards":[{"id":"https://openalex.org/G1323834836","display_name":"AF:  Small:  Approximation Algorithms for Graph and Combinatorial Optimization Problems","funder_award_id":"1016684","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G1881622834","display_name":null,"funder_award_id":"CCF-1016684","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2064821865","display_name":"AF: Small: Faster and Better Algorithms for, and via, Mathematical Programming Relaxations","funder_award_id":"1910149","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G346530407","display_name":null,"funder_award_id":"CCF-1910149","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G848032724","display_name":null,"funder_award_id":"Science","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/F4320332222","display_name":"University of Illinois at Urbana-Champaign","ror":"https://ror.org/047426m28"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2980970890.pdf","grobid_xml":"https://content.openalex.org/works/W2980970890.grobid-xml"},"referenced_works_count":39,"referenced_works":["https://openalex.org/W1465058481","https://openalex.org/W1494256302","https://openalex.org/W1497634048","https://openalex.org/W1521628414","https://openalex.org/W1542228838","https://openalex.org/W1544515183","https://openalex.org/W1675942548","https://openalex.org/W1963899113","https://openalex.org/W1968690018","https://openalex.org/W1973566854","https://openalex.org/W1975905867","https://openalex.org/W1976459503","https://openalex.org/W1976584101","https://openalex.org/W1983369141","https://openalex.org/W1985672402","https://openalex.org/W1989224473","https://openalex.org/W1991055327","https://openalex.org/W2001139415","https://openalex.org/W2011823863","https://openalex.org/W2045749371","https://openalex.org/W2047723482","https://openalex.org/W2047993669","https://openalex.org/W2052656799","https://openalex.org/W2056152695","https://openalex.org/W2089847997","https://openalex.org/W2089867501","https://openalex.org/W2091757422","https://openalex.org/W2163546498","https://openalex.org/W2172955861","https://openalex.org/W2204196730","https://openalex.org/W2405374478","https://openalex.org/W2417586110","https://openalex.org/W2570206580","https://openalex.org/W2610631890","https://openalex.org/W2752659909","https://openalex.org/W2997716981","https://openalex.org/W4244206605","https://openalex.org/W4250792653","https://openalex.org/W4254450489"],"related_works":["https://openalex.org/W1494256302","https://openalex.org/W3208565226","https://openalex.org/W2577636362","https://openalex.org/W171788235","https://openalex.org/W2950335857","https://openalex.org/W2749358524","https://openalex.org/W2963586530","https://openalex.org/W2950308273","https://openalex.org/W2037328176","https://openalex.org/W1512597827","https://openalex.org/W2778356976","https://openalex.org/W3082434130","https://openalex.org/W3166491318","https://openalex.org/W2008183483","https://openalex.org/W2143963903","https://openalex.org/W2093361910","https://openalex.org/W2952993756","https://openalex.org/W2002101153","https://openalex.org/W1536433263","https://openalex.org/W2058663301"],"abstract_inverted_index":{"We":[0,176],"consider":[1],"node-weighted":[2,20,168,184,242],"survivable":[3],"network":[4],"design":[5],"(SNDP)":[6],"in":[7,172,191,205,249],"planar":[8,128,250],"graphs":[9,174,251,257],"and":[10,30,70,90,121,170,226,233,245,252],"minor-closed":[11,138,254],"families":[12,255],"of":[13,18,42,56,80,140,230,256],"graphs.":[14],"The":[15,46],"input":[16,125],"consists":[17],"a":[19,51,136,206,211,259],"undirected":[21],"graph":[22,126,219],"G":[23,57],"=":[24,144],"(":[25,35,63,115,148,161],"V":[26],",":[27],"E":[28],")":[29,37,65,150],"integer":[31],"connectivity":[32,154,188,197],"requirements":[33,189],"r":[34,62,147],"uv":[36,44,64,76,146,149],"for":[38,72,119,167,183,195,200,241],"each":[39,73],"unordered":[40],"pair":[41,75],"nodes":[43],".":[45,77],"goal":[47],"is":[48,112,127,151],"to":[49,101,135,209],"find":[50],"minimum":[52],"weighted":[53],"subgraph":[54],"H":[55,60],"such":[58],"that":[59],"contains":[61],"disjoint":[66],"paths":[67,98],"between":[68],"u":[69],"v":[71],"node":[74],"Three":[78],"versions":[79],"the":[81,97,124,152,159,187,228],"problem":[82],"are":[83,99,190,223],"edge-connectivity":[84],"SNDP":[85,88,92],"(EC-SNDP),":[86],"element-connectivity":[87],"(Elem-SNDP),":[89],"vertex-connectivity":[91],"(VC-SNDP),":[93],"depending":[94],"on":[95],"whether":[96],"required":[100],"be":[102,203],"edge,":[103],"element,":[104],"or":[105,129],"vertex":[106],"disjoint,":[107],"respectively.":[108],"Our":[109,221],"main":[110],"result":[111,199],"an":[113,179],"O":[114,160,180],"k":[116,143,162],")-approximation":[117,165],"algorithm":[118],"EC-SNDP":[120,169],"Elem-SNDP":[122,171,201],"when":[123,186],"more":[130],"generally":[131],"if":[132],"it":[133],"belongs":[134],"proper":[137,253],"family":[139],"graphs;":[141],"here,":[142],"max":[145],"maximum":[153],"requirement.":[155],"This":[156],"improves":[157],"upon":[158],"log":[163],"n":[164],"known":[166,217],"general":[173,218],"[31].":[175],"also":[177],"obtain":[178,210],"(1)":[181],"approximation":[182],"VC-SNDP":[185],"{0,":[192],"1,":[193],"2};":[194],"higher":[196],"our":[198],"can":[202],"used":[204],"black-box":[207],"fashion":[208],"logarithmic":[212],"factor":[213,239],"improvement":[214],"over":[215],"currently":[216],"results.":[220],"results":[222],"inspired":[224],"by,":[225],"generalize,":[227],"work":[229],"Demaine,":[231],"Hajiaghayi,":[232],"Klein":[234],"[13],":[235],"who":[236],"obtained":[237],"constant":[238],"approximations":[240],"Steiner":[243,246],"tree":[244],"forest":[247],"problems":[248],"via":[258],"primal-dual":[260],"algorithm.":[261]},"counts_by_year":[],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}