{"id":"https://openalex.org/W2058605762","doi":"https://doi.org/10.1137/110854461","title":"Additive Approximation for Bounded Degree Survivable Network Design","display_name":"Additive Approximation for Bounded Degree Survivable Network Design","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W2058605762","doi":"https://doi.org/10.1137/110854461","mag":"2058605762"},"language":"en","primary_location":{"id":"doi:10.1137/110854461","is_oa":false,"landing_page_url":"https://doi.org/10.1137/110854461","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":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5020914506","display_name":"Mohit Singh","orcid":"https://orcid.org/0000-0002-0827-233X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mohit Singh","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5008440961"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.3318,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.92154445,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"42","issue":"6","first_page":"2217","last_page":"2242"},"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.9997000098228455,"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.9997000098228455,"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.9979000091552734,"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.9976000189781189,"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.8290826678276062},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.743003249168396},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.7080771327018738},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6576328873634338},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6200664043426514},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6182194352149963},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.4995462894439697},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4984462261199951},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.48809942603111267},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4600927233695984},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.4209222197532654}],"concepts":[{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.8290826678276062},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.743003249168396},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.7080771327018738},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6576328873634338},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6200664043426514},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6182194352149963},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.4995462894439697},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4984462261199951},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48809942603111267},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4600927233695984},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.4209222197532654},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/110854461","is_oa":false,"landing_page_url":"https://doi.org/10.1137/110854461","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.141.2080","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.141.2080","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cse.cuhk.edu.hk/~chi/papers/additive.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.559.5379","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.559.5379","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://appsrv.cse.cuhk.edu.hk/~chi/papers/additive.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1971422464","https://openalex.org/W1975884818","https://openalex.org/W1998141189","https://openalex.org/W2063807274","https://openalex.org/W2066700938","https://openalex.org/W2161190897","https://openalex.org/W2172955861"],"related_works":["https://openalex.org/W4362554012","https://openalex.org/W1968462015","https://openalex.org/W2752028650","https://openalex.org/W4309048849","https://openalex.org/W2949165555","https://openalex.org/W2086305925","https://openalex.org/W2154295079","https://openalex.org/W1871156538","https://openalex.org/W3032785099","https://openalex.org/W2888987890"],"abstract_inverted_index":{"In":[0,95,129],"the":[1,55,69,78,87,91,96,119,130,151,166,171,174],"minimum":[2,49],"bounded":[3],"degree":[4,35,59,79,92,120,152],"Steiner":[5,110,142],"network":[6,143],"problem,":[7],"we":[8],"are":[9,163],"given":[10],"an":[11,15,72],"undirected":[12],"graph":[13],"with":[14],"edge":[16],"cost":[17,50,70,89,113,145],"for":[18,25,39],"each":[19,26,40,122,154],"edge,":[20],"a":[21,34,48,103,109,135,141],"connectivity":[22,56],"requirement":[23],"$r_{uv}$":[24],"pair":[27],"of":[28,71,112,121,144,153,173],"vertices":[29],"$u$":[30],"and":[31,33,58,65,90,118,150,170],"$v$,":[32],"upper":[36,60],"bound":[37],"$b_v$":[38],"vertex":[41,123,155],"$v$.":[42],"The":[43,161],"task":[44],"is":[45,102,125,134,157,176],"to":[46],"find":[47],"subgraph":[51],"that":[52,75,85,107,139],"satisfies":[53,76],"all":[54,77],"requirements":[57],"bounds.":[61,80],"Let":[62],"$r_{\\max}:=\\max_{u,v}":[63],"\\{r_{uv}\\}$":[64],"${\\sc":[66],"opt}$":[67,117,149],"be":[68],"optimal":[73],"solution":[74],"We":[81],"present":[82],"approximation":[83],"algorithms":[84,162,175],"minimize":[86],"total":[88],"violation":[93],"simultaneously.":[94],"special":[97],"case":[98],"when":[99],"$r_{\\max}=1$,":[100],"there":[101,133],"polynomial":[104,136],"time":[105,137],"algorithm":[106,138],"returns":[108,140],"forest":[111],"at":[114,126,146,158],"most":[115,127,147,159],"$2{\\sc":[116,148],"$v$":[124,156],"$b_v+3$.":[128],"general":[131],"case,":[132],"$b_v+6r_{\\max}+3$.":[160],"based":[164],"on":[165],"iterative":[167],"relaxation":[168],"method,":[169],"analysis":[172],"nearly":[177],"tight.":[178]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}