{"id":"https://openalex.org/W2052687843","doi":"https://doi.org/10.1137/s0097539702416736","title":"Hardness of Approximation for Vertex-Connectivity Network Design Problems","display_name":"Hardness of Approximation for Vertex-Connectivity Network Design Problems","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W2052687843","doi":"https://doi.org/10.1137/s0097539702416736","mag":"2052687843"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539702416736","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539702416736","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/A5056370891","display_name":"Guy Kortsarz","orcid":null},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Guy Kortsarz","raw_affiliation_strings":["Department of Computer Sciences, Rutgers University, Camden, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Sciences, Rutgers University, Camden, USA","institution_ids":["https://openalex.org/I102322142"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5037378898","display_name":"Robert Krauthgamer","orcid":"https://orcid.org/0009-0003-8154-3735"},"institutions":[{"id":"https://openalex.org/I1297971548","display_name":"International Computer Science Institute","ror":"https://ror.org/01ewh7m12","country_code":"US","type":"nonprofit","lineage":["https://openalex.org/I1297971548"]},{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Robert Krauthgamer","raw_affiliation_strings":["International Computer Science Institute (ICSI) and Computer Science Division, University of California, Berkeley, USA"],"affiliations":[{"raw_affiliation_string":"International Computer Science Institute (ICSI) and Computer Science Division, University of California, Berkeley, USA","institution_ids":["https://openalex.org/I1297971548","https://openalex.org/I95457486"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028879014","display_name":"James R. Lee","orcid":"https://orcid.org/0000-0002-3512-1617"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"James R. Lee","raw_affiliation_strings":["Computer Science Division, University of California, Berkeley, USA"],"affiliations":[{"raw_affiliation_string":"Computer Science Division, University of California, Berkeley, USA","institution_ids":["https://openalex.org/I95457486"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5056370891"],"corresponding_institution_ids":["https://openalex.org/I102322142"],"apc_list":null,"apc_paid":null,"fwci":5.1856,"has_fulltext":false,"cited_by_count":138,"citation_normalized_percentile":{"value":0.95673491,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":"33","issue":"3","first_page":"704","last_page":"720"},"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.9983000159263611,"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.996999979019165,"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.7499490976333618},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6803874969482422},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.6618233919143677},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6512420177459717},{"id":"https://openalex.org/keywords/dtime","display_name":"DTIME","score":0.6486830711364746},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5935158729553223},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5852851867675781},{"id":"https://openalex.org/keywords/hardness-of-approximation","display_name":"Hardness of approximation","score":0.5730676651000977},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.514167308807373},{"id":"https://openalex.org/keywords/vertex-connectivity","display_name":"Vertex connectivity","score":0.4807869791984558},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4424273371696472},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.43612807989120483},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4055567979812622},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.16246917843818665},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.1548132598400116},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.11458593606948853}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7499490976333618},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6803874969482422},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6618233919143677},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6512420177459717},{"id":"https://openalex.org/C15547884","wikidata":"https://www.wikidata.org/wiki/Q1155831","display_name":"DTIME","level":5,"score":0.6486830711364746},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5935158729553223},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5852851867675781},{"id":"https://openalex.org/C112955886","wikidata":"https://www.wikidata.org/wiki/Q5656275","display_name":"Hardness of approximation","level":3,"score":0.5730676651000977},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.514167308807373},{"id":"https://openalex.org/C2983226441","wikidata":"https://www.wikidata.org/wiki/Q3115621","display_name":"Vertex connectivity","level":4,"score":0.4807869791984558},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4424273371696472},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.43612807989120483},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4055567979812622},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.16246917843818665},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.1548132598400116},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.11458593606948853},{"id":"https://openalex.org/C131671149","wikidata":"https://www.wikidata.org/wiki/Q2703890","display_name":"Universal Turing machine","level":4,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0097539702416736","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539702416736","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":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":38,"referenced_works":["https://openalex.org/W204341840","https://openalex.org/W225145913","https://openalex.org/W1515157528","https://openalex.org/W1539191226","https://openalex.org/W1898045598","https://openalex.org/W1970259241","https://openalex.org/W1983684016","https://openalex.org/W1984289304","https://openalex.org/W1986478184","https://openalex.org/W1996967579","https://openalex.org/W1997369416","https://openalex.org/W2002452451","https://openalex.org/W2029687674","https://openalex.org/W2037328176","https://openalex.org/W2037686175","https://openalex.org/W2038041864","https://openalex.org/W2038686820","https://openalex.org/W2047948011","https://openalex.org/W2048815229","https://openalex.org/W2051699458","https://openalex.org/W2069138465","https://openalex.org/W2077642252","https://openalex.org/W2078501279","https://openalex.org/W2114073307","https://openalex.org/W2134875769","https://openalex.org/W2135242101","https://openalex.org/W2141355868","https://openalex.org/W2143996311","https://openalex.org/W2146146025","https://openalex.org/W2148352980","https://openalex.org/W2172955861","https://openalex.org/W2611804663","https://openalex.org/W2766198272","https://openalex.org/W2798588639","https://openalex.org/W3149110984","https://openalex.org/W3161056635","https://openalex.org/W4234462414","https://openalex.org/W4249318479"],"related_works":["https://openalex.org/W2949165555","https://openalex.org/W1956536100","https://openalex.org/W2963411648","https://openalex.org/W4297731553","https://openalex.org/W1534786826","https://openalex.org/W4298059473","https://openalex.org/W2951513093","https://openalex.org/W2950625434","https://openalex.org/W2062172380","https://openalex.org/W2052687843"],"abstract_inverted_index":{"In":[0],"the":[1,6,21,28,46,52,58,92,97,100,107],"survivable":[2],"networkdesign":[3],"problem":[4,59,104],"(SNDP),":[5],"goal":[7],"is":[8],"to":[9],"find":[10],"a":[11,36,110,115],"minimum-cost":[12],"spanning":[13],"subgraph":[14],"satisfying":[15],"certain":[16],"connectivity":[17,108],"requirements.":[18],"We":[19,44,76],"study":[20],"vertex-connectivity":[22],"variant":[23],"of":[24,34,39,54,79,87,99,105,109],"SNDP":[25],"in":[26],"which":[27],"input":[29],"specifies,":[30],"for":[31,67,82],"each":[32],"pair":[33],"vertices,":[35],"required":[37],"number":[38],"vertex-disjoint":[40],"paths":[41],"connecting":[42],"them.":[43],"give":[45],"first":[47,93],"strong":[48],"lower":[49,94],"bound":[50,95],"on":[51,96],"approximability":[53,98],"SNDP,":[55,88],"showing":[56],"that":[57],"admits":[60],"no":[61],"efficient":[62],"$2^{\\log^{1-\\epsilon}":[63],"n}$":[64],"ratio":[65],"approximation":[66,80],"any":[68],"fixed":[69],"$\\epsilon\\!":[70],">\\!":[71],"0$,":[72],"unless":[73],"$\\NP\\subseteq":[74],"\\DTIME(n^{\\polylog(n)})$.":[75],"show":[77],"hardness":[78],"results":[81],"some":[83],"important":[84],"special":[85],"cases":[86],"and":[89],"we":[90],"exhibit":[91],"related":[101],"classical":[102],"NP-hard":[103],"augmenting":[106],"graph":[111],"using":[112],"edges":[113],"from":[114],"given":[116],"set.":[117]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":2},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":15}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}