{"id":"https://openalex.org/W2144241285","doi":"https://doi.org/10.1145/2831235","title":"The Two-Edge Connectivity Survivable-Network Design Problem in Planar Graphs","display_name":"The Two-Edge Connectivity Survivable-Network Design Problem in Planar Graphs","publication_year":2016,"publication_date":"2016-04-25","ids":{"openalex":"https://openalex.org/W2144241285","doi":"https://doi.org/10.1145/2831235","mag":"2144241285"},"language":"en","primary_location":{"id":"doi:10.1145/2831235","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2831235","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/2831235?download=true","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":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/2831235?download=true","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5108529502","display_name":"Glencora Borradaile","orcid":null},"institutions":[{"id":"https://openalex.org/I131249849","display_name":"Oregon State University","ror":"https://ror.org/00ysfqy60","country_code":"US","type":"education","lineage":["https://openalex.org/I131249849"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Glencora Borradaile","raw_affiliation_strings":["Oregon State University","Oregon State University>"],"affiliations":[{"raw_affiliation_string":"Oregon State University","institution_ids":["https://openalex.org/I131249849"]},{"raw_affiliation_string":"Oregon State University>","institution_ids":["https://openalex.org/I131249849"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035567880","display_name":"Philip N. Klein","orcid":null},"institutions":[{"id":"https://openalex.org/I175594653","display_name":"John Brown University","ror":"https://ror.org/02ct41q97","country_code":"US","type":"education","lineage":["https://openalex.org/I175594653"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Philip Klein","raw_affiliation_strings":["Brown University"],"affiliations":[{"raw_affiliation_string":"Brown University","institution_ids":["https://openalex.org/I175594653"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5108529502"],"corresponding_institution_ids":["https://openalex.org/I131249849"],"apc_list":null,"apc_paid":null,"fwci":0.886,"has_fulltext":true,"cited_by_count":5,"citation_normalized_percentile":{"value":0.76759874,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"12","issue":"3","first_page":"1","last_page":"29"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9973000288009644,"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"}},"topics":[{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9973000288009644,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9962999820709229,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9898999929428101,"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.7580596208572388},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.627947211265564},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.597779393196106},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.5728774666786194},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.49533191323280334},{"id":"https://openalex.org/keywords/cograph","display_name":"Cograph","score":0.44950616359710693},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.42893078923225403},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.41837385296821594},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4116445481777191},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3607028126716614},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.34932267665863037},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.2770938277244568}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7580596208572388},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.627947211265564},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.597779393196106},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.5728774666786194},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.49533191323280334},{"id":"https://openalex.org/C59824394","wikidata":"https://www.wikidata.org/wiki/Q5141281","display_name":"Cograph","level":5,"score":0.44950616359710693},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.42893078923225403},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.41837385296821594},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4116445481777191},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3607028126716614},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.34932267665863037},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.2770938277244568}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2831235","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2831235","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/2831235?download=true","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":{"id":"doi:10.1145/2831235","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2831235","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/2831235?download=true","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":[],"awards":[{"id":"https://openalex.org/G2416315485","display_name":null,"funder_award_id":"CCF-09-64037, CCF-14-09520,CCF-0963921","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3115650792","display_name":null,"funder_award_id":"096403","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3497978841","display_name":"AF:  Medium:  Collaborative Research:  Solutions to Planar Optimization Problems","funder_award_id":"0964037","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4287868585","display_name":null,"funder_award_id":"CCF-0964037","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7584120202","display_name":null,"funder_award_id":"CCF-0963921","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G927998052","display_name":"AF:  Medium:  Collaborative Research:  Solutions to Planar Optimization Problems","funder_award_id":"0963921","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/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2144241285.pdf","grobid_xml":"https://content.openalex.org/works/W2144241285.grobid-xml"},"referenced_works_count":33,"referenced_works":["https://openalex.org/W625072069","https://openalex.org/W1529513351","https://openalex.org/W1550399701","https://openalex.org/W1572973141","https://openalex.org/W1590399153","https://openalex.org/W1607394607","https://openalex.org/W1985672402","https://openalex.org/W1989224473","https://openalex.org/W1990317614","https://openalex.org/W1993553699","https://openalex.org/W1995473411","https://openalex.org/W2034207294","https://openalex.org/W2038686820","https://openalex.org/W2042660957","https://openalex.org/W2045749371","https://openalex.org/W2051699458","https://openalex.org/W2065166038","https://openalex.org/W2082176459","https://openalex.org/W2092113566","https://openalex.org/W2131926707","https://openalex.org/W2132169470","https://openalex.org/W2145145566","https://openalex.org/W2150855695","https://openalex.org/W2156760067","https://openalex.org/W2172955861","https://openalex.org/W2337910325","https://openalex.org/W2502117809","https://openalex.org/W2561675875","https://openalex.org/W2570206580","https://openalex.org/W2762935521","https://openalex.org/W3022690009","https://openalex.org/W4234462414","https://openalex.org/W6633714127"],"related_works":["https://openalex.org/W2108770488","https://openalex.org/W3160792420","https://openalex.org/W4287181997","https://openalex.org/W2045730620","https://openalex.org/W2886071965","https://openalex.org/W4297803065","https://openalex.org/W2395770054","https://openalex.org/W2949729914","https://openalex.org/W2168266982","https://openalex.org/W2963028755"],"abstract_inverted_index":{"Consider":[0],"the":[1,42,83,118,129,138,162,181,185,193,210],"following":[2],"problem:":[3],"given":[4],"a":[5,11,17,38,54,65,86,124,196,200,205],"graph":[6],"with":[7],"edge":[8],"costs":[9],"and":[10,154],"subset":[12],"Q":[13,33],"of":[14,30,41,114,137,195,199],"vertices,":[15],"find":[16,85,209],"minimum-cost":[18,87],"subgraph":[19,88],"in":[20,32,49,61,82,89,120,127,151,157,167],"which":[21,90,128],"there":[22,91],"are":[23,92,187],"two":[24],"edge-disjoint":[25,103],"paths":[26,107],"connecting":[27],"every":[28,109],"pair":[29,110],"vertices":[31,191],".":[34],"The":[35,146,170],"problem":[36,45,119,147],"is":[37,131,148,173],"failure-resilient":[39],"analog":[40],"Steiner":[43],"tree":[44],"arising,":[46],"for":[47,78,108,143,190],"example,":[48],"telecommunications":[50,62],"applications.":[51],"We":[52,116,160],"study":[53],"more":[55],"general":[56,152],"mixed-connectivity":[57],"formulation,":[58],"also":[59],"employed":[60],"optimization.":[63],"Given":[64],"number":[66],"(or":[67],"requirement":[68],")":[69,73],"r":[70,95,99],"(":[71,96,100,175],"v":[72,81,101,106,113],"\u2208":[74],"{0,":[75],"1,":[76],"2}":[77],"each":[79,144],"vertex":[80],"graph,":[84,202],"min":[93],"{":[94],"u":[97,104,111],"),":[98],")}":[102],"-to-":[105],",":[112],"vertices.":[115],"address":[117],"planar":[121,158,168,201],"graphs,":[122],"considering":[123],"popular":[125],"relaxation":[126],"solution":[130],"allowed":[132],"to":[133,208],"use":[134],"multiple":[135],"copies":[136],"input-graph":[139],"edges":[140],"(paying":[141],"separately":[142],"copy).":[145],"max":[149],"SNP-hard":[150],"graphs":[153],"strongly":[155],"NP-hard":[156],"graphs.":[159,169],"give":[161,204],"first":[163],"polynomial-time":[164,206],"approximation":[165],"scheme":[166],"running":[171],"time":[172],"O":[174],"n":[176,178],"log":[177],").":[179],"Under":[180],"additional":[182],"restriction":[183],"that":[184],"requirements":[186],"only":[188],"non-zero":[189],"on":[192],"boundary":[194],"single":[197],"face":[198],"we":[203],"algorithm":[207],"optimal":[211],"solution.":[212]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":1}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-10T00:00:00"}