{"id":"https://openalex.org/W2155177580","doi":"https://doi.org/10.1137/090746495","title":"Degree Bounded Network Design with Metric Costs","display_name":"Degree Bounded Network Design with Metric Costs","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W2155177580","doi":"https://doi.org/10.1137/090746495","mag":"2155177580"},"language":"en","primary_location":{"id":"doi:10.1137/090746495","is_oa":false,"landing_page_url":"https://doi.org/10.1137/090746495","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/A5102723253","display_name":"Yuk Hei Chan","orcid":"https://orcid.org/0009-0002-4403-2971"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Yuk Hei Chan","raw_affiliation_strings":["yhchan@cse.cuhk.edu.hk and wsfung@cse.cuhk.edu.hk and chi@cse.cuhk.edu.hk and ckyung@cse.cuhk.edu.hk#TAB#"],"affiliations":[{"raw_affiliation_string":"yhchan@cse.cuhk.edu.hk and wsfung@cse.cuhk.edu.hk and chi@cse.cuhk.edu.hk and ckyung@cse.cuhk.edu.hk#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109428407","display_name":"Wai Shing Fung","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wai Shing Fung","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5008440961","display_name":"Lap Chi Lau","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lap Chi Lau","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5001781067","display_name":"Chun Kong Yung","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chun Kong Yung","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5102723253"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.2926,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.81247257,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"40","issue":"4","first_page":"953","last_page":"980"},"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.9969000220298767,"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.9944000244140625,"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/bounded-function","display_name":"Bounded function","score":0.7381978631019592},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.7284812927246094},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.7150869965553284},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7088583707809448},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6536450386047363},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.514074444770813},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.4894310534000397},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.44948938488960266},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.44611623883247375},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.42258864641189575},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.4181819558143616},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3061144948005676}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.7381978631019592},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.7284812927246094},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.7150869965553284},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7088583707809448},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6536450386047363},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.514074444770813},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.4894310534000397},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.44948938488960266},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.44611623883247375},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.42258864641189575},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.4181819558143616},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3061144948005676},{"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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1137/090746495","is_oa":false,"landing_page_url":"https://doi.org/10.1137/090746495","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.835","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.141.835","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/metric.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.348.4541","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.348.4541","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/metric.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.352.3734","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.352.3734","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","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":26,"referenced_works":["https://openalex.org/W1786780942","https://openalex.org/W1980942794","https://openalex.org/W1981743701","https://openalex.org/W2002985966","https://openalex.org/W2006060626","https://openalex.org/W2010478727","https://openalex.org/W2016764804","https://openalex.org/W2017501272","https://openalex.org/W2027868217","https://openalex.org/W2028957123","https://openalex.org/W2037328176","https://openalex.org/W2042489938","https://openalex.org/W2048815229","https://openalex.org/W2049754879","https://openalex.org/W2062530569","https://openalex.org/W2072970094","https://openalex.org/W2079430060","https://openalex.org/W2088839217","https://openalex.org/W2092113566","https://openalex.org/W2097945626","https://openalex.org/W2116680937","https://openalex.org/W2159586130","https://openalex.org/W2167579893","https://openalex.org/W2172955861","https://openalex.org/W2178484001","https://openalex.org/W2602800732"],"related_works":["https://openalex.org/W2418231958","https://openalex.org/W2099915933","https://openalex.org/W3116169590","https://openalex.org/W1703428550","https://openalex.org/W4380840098","https://openalex.org/W2044443696","https://openalex.org/W2503538928","https://openalex.org/W3101281637","https://openalex.org/W2390742649","https://openalex.org/W1584380088"],"abstract_inverted_index":{"Given":[0],"a":[1,5,11,24,39,46,50,107,123,139,158,183,247,263],"complete":[2],"undirected":[3],"graph,":[4],"cost":[6,26,83,210,219],"function":[7,84],"on":[8],"edges,":[9],"and":[10,63,138,205,281],"degree":[12,16,31,55,97,114,130,165,190,224,229,276],"bound":[13],"B,":[14],"the":[15,54,82,86,111,127,149,162,174,187,200,209,217,253,285],"bounded":[17,56,98,113,129,164,189],"network":[18,57,99,132,235],"design":[19,58,100,236],"problem":[20,59,133,168],"is":[21,60,66,106,122,136,144,148,157,173,182,212,262,269],"to":[22,216,271],"find":[23],"minimum":[25,112,128,163,188],"simple":[27,40],"subgraph":[28,116,167],"with":[29,199,238,274],"maximum":[30,150,203],"B":[32],"satisfying":[33],"given":[34],"connectivity":[35,41,151,279],"requirements.":[36],"Even":[37],"for":[38,53,72,95,110,126,161,186,252],"requirement":[42],"such":[43],"as":[44,246],"finding":[45],"spanning":[47,179,191],"tree,":[48,180],"computing":[49],"feasible":[51],"solution":[52],"already":[61],"NP-hard,":[62],"thus":[64],"there":[65,89,105,121,156,181,221],"no":[67,223],"polynomial":[68],"factor":[69,92],"approximation":[70,93,195],"algorithm":[71,109,125,141,160,185,251],"this":[73,76],"problem.":[74,117,193,257],"In":[75,102,118,153],"paper,":[77],"we":[78],"show":[79],"that":[80,228],"when":[81,134,142,169,220],"satisfies":[85],"triangle":[87],"inequality,":[88],"are":[90,222],"constant":[91],"algorithms":[94,196,242],"various":[96],"problems.":[101],"global":[103,154],"edge-connectivity,":[104,120],"$(2+\\frac{1}{k})$-approximation":[108],"k-edge-connected":[115],"local":[119],"4-approximation":[124],"Steiner":[131],"$r_{\\max}$":[135,143,147],"even,":[137],"5.5-approximation":[140],"odd,":[145],"where":[146,171],"requirement.":[152],"vertex-connectivity,":[155],"$(2+\\frac{k-1}{n}+\\frac{1}{k})$-approximation":[159],"k-vertex-connected":[166],"$n\\geq2k$,":[170],"n":[172],"number":[175],"of":[176,249,284],"vertices.":[177],"For":[178],"$(1+\\frac{1}{B-1})$-approximation":[184],"tree":[192],"These":[194],"return":[197],"solutions":[198],"smallest":[201],"possible":[202],"degree,":[204],"in":[206],"most":[207],"cases":[208],"guarantee":[211],"obtained":[213],"by":[214],"comparing":[215],"optimal":[218],"constraints.":[225],"This":[226],"demonstrates":[227],"constraints":[230],"can":[231,243],"be":[232,244],"incorporated":[233],"into":[234],"problems":[237],"metric":[239,254],"costs.":[240],"Our":[241],"seen":[245],"generalization":[248],"Christofides'":[250],"traveling":[255],"salesman":[256],"The":[258],"main":[259],"technical":[260],"tool":[261],"simplicity-preserving":[264],"edge":[265],"splitting-off":[266],"operation,":[267],"which":[268],"used":[270],"\u201cshort-cut\u201d":[272],"vertices":[273],"high":[275],"while":[277],"maintaining":[278],"requirements":[280],"preserving":[282],"simplicity":[283],"solutions.":[286]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}