{"id":"https://openalex.org/W2174245573","doi":"https://doi.org/10.1137/13094503x","title":"Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design","display_name":"Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design","publication_year":2015,"publication_date":"2015-01-01","ids":{"openalex":"https://openalex.org/W2174245573","doi":"https://doi.org/10.1137/13094503x","mag":"2174245573"},"language":"en","primary_location":{"id":"doi:10.1137/13094503x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/13094503x","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/A5054214899","display_name":"Takuro Fukunaga","orcid":"https://orcid.org/0000-0003-3285-2876"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Takuro Fukunaga","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5003622145","display_name":"Zeev Nutov","orcid":"https://orcid.org/0000-0002-6629-3243"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zeev Nutov","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5087844619","display_name":"R. Ravi","orcid":"https://orcid.org/0000-0001-7603-1207"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"R. Ravi","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5054214899"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.4536,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.89748913,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"44","issue":"5","first_page":"1202","last_page":"1229"},"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.9998999834060669,"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.9998999834060669,"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.998199999332428,"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.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"}}],"keywords":[{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.7600470781326294},{"id":"https://openalex.org/keywords/rounding","display_name":"Rounding","score":0.7477267980575562},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.7449700832366943},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6069191694259644},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6027872562408447},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.5738685131072998},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5547347664833069},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5339967608451843},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.48754972219467163},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.4856678247451782},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.4855441749095917},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4268929064273834},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.38699871301651},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.37292683124542236},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36949479579925537},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.28166717290878296}],"concepts":[{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.7600470781326294},{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.7477267980575562},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.7449700832366943},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6069191694259644},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6027872562408447},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.5738685131072998},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5547347664833069},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5339967608451843},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48754972219467163},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.4856678247451782},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.4855441749095917},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4268929064273834},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.38699871301651},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.37292683124542236},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36949479579925537},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.28166717290878296},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","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/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/13094503x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/13094503x","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W1967595345","https://openalex.org/W1968690018","https://openalex.org/W1975776599","https://openalex.org/W1976459503","https://openalex.org/W1983217642","https://openalex.org/W1984289304","https://openalex.org/W1986011879","https://openalex.org/W1988132050","https://openalex.org/W2004163233","https://openalex.org/W2015382802","https://openalex.org/W2018831729","https://openalex.org/W2033691165","https://openalex.org/W2052340714","https://openalex.org/W2052656799","https://openalex.org/W2058521212","https://openalex.org/W2058605762","https://openalex.org/W2069138465","https://openalex.org/W2078501279","https://openalex.org/W2109095726","https://openalex.org/W2116510876","https://openalex.org/W2161190897","https://openalex.org/W2163546498","https://openalex.org/W2163661406","https://openalex.org/W2172955861","https://openalex.org/W2174409790","https://openalex.org/W2178196238","https://openalex.org/W2178484001","https://openalex.org/W2405374478","https://openalex.org/W2891873695"],"related_works":["https://openalex.org/W2230311946","https://openalex.org/W3100114454","https://openalex.org/W2507810539","https://openalex.org/W1600160158","https://openalex.org/W2543175834","https://openalex.org/W2137277194","https://openalex.org/W3175189485","https://openalex.org/W4287593987","https://openalex.org/W2561769964","https://openalex.org/W2109445739"],"abstract_inverted_index":{"We":[0,25],"consider":[1],"the":[2,32,59,62,69,80,107,110,117,126,131,137],"problem":[3],"of":[4,11,31,64,112],"finding":[5],"a":[6,12,47,52,56,100,104],"minimum":[7],"edge":[8],"cost":[9,132],"subgraph":[10],"graph":[13],"satisfying":[14],"both":[15],"given":[16],"node-connectivity":[17,150],"requirements":[18,45,91],"and":[19,43,61,89,109,133,157,160,164],"degree":[20,63,81,111],"upper":[21,82],"bounds":[22],"on":[23,58,84,106,130,136],"nodes.":[24],"present":[26],"an":[27],"iterative":[28],"rounding":[29],"algorithm":[30,50,98],"biset":[33],"linear":[34],"programming":[35],"relaxation":[36],"for":[37,148],"this":[38],"problem.":[39],"For":[40,86],"directed":[41,156],"graphs":[42,88],"$k$-out-connectivity":[44],"from":[46],"root,":[48],"our":[49,97],"computes":[51,99],"solution":[53,70,101,118],"that":[54,102],"is":[55,71,79,103,119],"2-approximation":[57],"cost,":[60,108],"each":[65,113],"node":[66,114],"$v$":[67,115],"in":[68,116],"at":[72,120],"most":[73,121],"$2b(v)":[74],"+":[75],"O(k)$,":[76],"where":[77],"$b(v)$":[78],"bound":[83],"$v$.":[85],"undirected":[87,154,158,161],"element-connectivity":[90],"with":[92],"maximum":[93],"connectivity":[94],"requirement":[95],"$k$,":[96],"$4$-approximation":[105],"$4b(v)+O(k)$.":[122],"These":[123],"ratios":[124,147],"improve":[125,145],"previous":[127],"$O(\\log":[128],"k)$-approximation":[129],"$O(2^k":[134],"b(v))$-approximation":[135],"degrees.":[138],"Our":[139],"algorithms":[140],"can":[141],"be":[142],"used":[143],"to":[144],"approximation":[146],"other":[149],"problems":[151],"such":[152],"as":[153],"$k$-out-connectivity,":[155],"$k$-connectivity,":[159],"rooted":[162],"$k$-connectivity":[163],"subset":[165],"$k$-connectivity.":[166]},"counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}