{"id":"https://openalex.org/W2161190897","doi":"https://doi.org/10.1137/070700620","title":"Survivable Network Design with Degree or Order Constraints","display_name":"Survivable Network Design with Degree or Order Constraints","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W2161190897","doi":"https://doi.org/10.1137/070700620","mag":"2161190897"},"language":"en","primary_location":{"id":"doi:10.1137/070700620","is_oa":false,"landing_page_url":"https://doi.org/10.1137/070700620","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5008440961","display_name":"Lap Chi Lau","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Lap Chi Lau","raw_affiliation_strings":["chi@cse.cuhk.edu.hk#TAB#"],"affiliations":[{"raw_affiliation_string":"chi@cse.cuhk.edu.hk#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025400832","display_name":"Joseph Naor","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Joseph (Seffi) Naor","raw_affiliation_strings":["naor@cs.technion.ac.il#TAB#"],"affiliations":[{"raw_affiliation_string":"naor@cs.technion.ac.il#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5010339836","display_name":"Mohammad R. Salavatipour","orcid":"https://orcid.org/0000-0002-7650-2045"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mohammad R. Salavatipour","raw_affiliation_strings":["mreza@cs.ualberta.ca#TAB#"],"affiliations":[{"raw_affiliation_string":"mreza@cs.ualberta.ca#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5020914506","display_name":"Mohit Singh","orcid":"https://orcid.org/0000-0002-0827-233X"},"institutions":[{"id":"https://openalex.org/I154425047","display_name":"University of Alberta","ror":"https://ror.org/0160cpw27","country_code":"CA","type":"education","lineage":["https://openalex.org/I154425047"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Mohit Singh","raw_affiliation_strings":["Department of Computing Science, University of Alberta, Edmonton, AB T6G 2E8, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Computing Science, University of Alberta, Edmonton, AB T6G 2E8, Canada","institution_ids":["https://openalex.org/I154425047"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5008440961"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":8.4817,"has_fulltext":false,"cited_by_count":73,"citation_normalized_percentile":{"value":0.98152416,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"39","issue":"3","first_page":"1062","last_page":"1087"},"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.9980999827384949,"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.9943000078201294,"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/degree","display_name":"Degree (music)","score":0.7835535407066345},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6529983282089233},{"id":"https://openalex.org/keywords/network-planning-and-design","display_name":"Network planning and design","score":0.6311354637145996},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6080114245414734},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5980639457702637},{"id":"https://openalex.org/keywords/rounding","display_name":"Rounding","score":0.5862323045730591},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.5134345293045044},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.48989933729171753},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.38608646392822266},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.366519570350647},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.34568554162979126},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2990970015525818},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.27121418714523315}],"concepts":[{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.7835535407066345},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6529983282089233},{"id":"https://openalex.org/C114563136","wikidata":"https://www.wikidata.org/wiki/Q19725982","display_name":"Network planning and design","level":2,"score":0.6311354637145996},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6080114245414734},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5980639457702637},{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.5862323045730591},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.5134345293045044},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.48989933729171753},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.38608646392822266},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.366519570350647},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.34568554162979126},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2990970015525818},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.27121418714523315},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","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/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","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/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/070700620","is_oa":false,"landing_page_url":"https://doi.org/10.1137/070700620","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Life in Land","score":0.6100000143051147,"id":"https://metadata.un.org/sdg/15"}],"awards":[{"id":"https://openalex.org/G1015447957","display_name":null,"funder_award_id":"2002276","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3839291106","display_name":null,"funder_award_id":"366/07","funder_id":"https://openalex.org/F4320322252","funder_display_name":"Israel Science Foundation"},{"id":"https://openalex.org/G4002418777","display_name":null,"funder_award_id":"1366/07","funder_id":"https://openalex.org/F4320322252","funder_display_name":"Israel Science Foundation"},{"id":"https://openalex.org/G6484169224","display_name":"ITR/SY+IM+AP: Center for Applied Algorithms","funder_award_id":"0122581","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6546929923","display_name":null,"funder_award_id":"CCR-0122581","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"},{"id":"https://openalex.org/G97666921","display_name":"New Directions in Approximation Algorithms","funder_award_id":"0430751","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/F4320308943","display_name":"Microsoft Research","ror":"https://ror.org/00d0nc645"},{"id":"https://openalex.org/F4320310207","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33"},{"id":"https://openalex.org/F4320319946","display_name":"University of Alberta","ror":"https://ror.org/0160cpw27"},{"id":"https://openalex.org/F4320322252","display_name":"Israel Science Foundation","ror":"https://ror.org/04sazxf24"},{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W148876617","https://openalex.org/W1505339140","https://openalex.org/W1575625195","https://openalex.org/W1590881797","https://openalex.org/W1968690018","https://openalex.org/W1970259241","https://openalex.org/W1971422464","https://openalex.org/W1975884818","https://openalex.org/W1998141189","https://openalex.org/W1998678640","https://openalex.org/W2001139415","https://openalex.org/W2002764437","https://openalex.org/W2012586162","https://openalex.org/W2019578639","https://openalex.org/W2036836182","https://openalex.org/W2038190710","https://openalex.org/W2044119054","https://openalex.org/W2052687843","https://openalex.org/W2055505431","https://openalex.org/W2063807274","https://openalex.org/W2066700938","https://openalex.org/W2100440346","https://openalex.org/W2112594285","https://openalex.org/W2147258429","https://openalex.org/W2148352980","https://openalex.org/W2157421865","https://openalex.org/W2171319172","https://openalex.org/W2172955861","https://openalex.org/W2176619219","https://openalex.org/W2611804663","https://openalex.org/W2803888831","https://openalex.org/W2988480584","https://openalex.org/W4248455257"],"related_works":["https://openalex.org/W2367195720","https://openalex.org/W1968497507","https://openalex.org/W1998126097","https://openalex.org/W1980288485","https://openalex.org/W2009976792","https://openalex.org/W2004321562","https://openalex.org/W3184075718","https://openalex.org/W328736688","https://openalex.org/W2995411114","https://openalex.org/W2404561224"],"abstract_inverted_index":{"We":[0,244,284],"present":[1],"algorithmic":[2,206,234],"and":[3,46,107,149,165,232,277],"hardness":[4],"results":[5,143],"for":[6,76,127,158,236,289,314],"network":[7,131,241],"design":[8,132,242],"problems":[9,272],"with":[10,26,83,185,256],"degree":[11,27,48,84,105,109,129,186],"or":[12],"order":[13],"constraints.":[14],"The":[15,31],"first":[16,121,152],"problem":[17,25,64,82,164,184,248,308],"we":[18,176,262,302],"consider":[19],"is":[20,33,72,93,114,188,199,208,212,220],"the":[21,53,57,77,87,90,97,104,108,120,135,151,159,166,179,194,215,247,264,275,278,290,298,306],"Survivable":[22,79,181],"Network":[23,80,182],"Design":[24,81,183],"constraints":[28,187],"on":[29,52,214],"vertices.":[30,54],"objective":[32],"to":[34,146,190,297,312],"find":[35],"a":[36,66,73,237,251,286],"minimum":[37,252,279],"cost":[38,88,98,195,253,280],"subgraph":[39,255,282],"which":[40,219,261],"satisfies":[41],"connectivity":[42],"requirements":[43],"between":[44],"vertices":[45],"also":[47,144,245],"upper":[49],"bounds":[50],"$B_v$":[51],"This":[55,118,228,267],"includes":[56],"well-studied":[58,270],"Minimum":[59,136,160,167],"Bounded":[60,137,161,168],"Degree":[61,138,162,169],"Spanning":[62],"Tree":[63],"as":[65,274],"special":[67],"case.":[68],"Our":[69,142],"main":[70],"result":[71,207],"$(2,2B_v+3)$-approximation":[74],"algorithm":[75],"edge-connectivity":[78],"constraints,":[85],"where":[86],"of":[89,99,110,196,204,223,240,249],"returned":[91],"solution":[92,102],"at":[94,115,257],"most":[95,116],"twice":[96],"an":[100,221,230],"optimum":[101],"(satisfying":[103],"bounds)":[106],"each":[111],"vertex":[112],"v":[113],"$2B_v+3$.":[117],"implies":[119],"constant":[122,153],"factor":[123,154],"(bicriteria)":[124,155],"approximation":[125,156,288],"algorithms":[126,157],"many":[128],"constrained":[130],"problems,":[133],"including":[134],"Steiner":[139],"Forest":[140],"problem.":[141,173,266,292],"extend":[145],"directed":[147],"graphs":[148],"provide":[150,303],"Arborescence":[163],"Strongly":[170],"k-Edge-Connected":[171],"Subgraph":[172],"In":[174],"contrast,":[175],"show":[177],"that":[178,305],"vertex-connectivity":[180],"hard":[189,311],"approximate,":[191],"even":[192],"when":[193],"every":[197],"edge":[198],"zero.":[200],"A":[201],"striking":[202],"aspect":[203],"our":[205],"its":[209],"simplicity.":[210],"It":[211],"based":[213],"iterative":[216,225],"relaxation":[217],"method,":[218],"extension":[222],"Jain's":[224],"rounding":[226],"method.":[227],"provides":[229],"elegant":[231],"unifying":[233],"framework":[235],"broad":[238],"range":[239],"problems.":[243,283],"study":[246],"finding":[250],"$\\lambda$-edge-connected":[254,281],"least":[258],"k":[259],"vertices,":[260],"call":[263],"$(k,\\lambda)$-subgraph":[265,307],"generalizes":[268],"some":[269],"classical":[271],"such":[273],"k-MST":[276],"give":[285],"polylogarithmic":[287],"$(k,2)$-subgraph":[291],"However,":[293],"by":[294],"relating":[295],"it":[296],"Densest":[299],"k-Subgraph":[300],"problem,":[301],"evidence":[304],"might":[309],"be":[310],"approximate":[313],"arbitrary":[315],"$\\lambda$.":[316]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":10}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}