{"id":"https://openalex.org/W2004240896","doi":"https://doi.org/10.1145/1103963.1103967","title":"Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design","display_name":"Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design","publication_year":2005,"publication_date":"2005-10-01","ids":{"openalex":"https://openalex.org/W2004240896","doi":"https://doi.org/10.1145/1103963.1103967","mag":"2004240896"},"language":"en","primary_location":{"id":"doi:10.1145/1103963.1103967","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1103963.1103967","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","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/A5013914345","display_name":"Raja Jothi","orcid":null},"institutions":[{"id":"https://openalex.org/I1299303238","display_name":"National Institutes of Health","ror":"https://ror.org/01cwqze88","country_code":"US","type":"government","lineage":["https://openalex.org/I1299022934","https://openalex.org/I1299303238"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Raja Jothi","raw_affiliation_strings":["National Institutes of Health, Bethesda, MD","National Institutes of Health, Bethesda MD#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"National Institutes of Health, Bethesda, MD","institution_ids":["https://openalex.org/I1299303238"]},{"raw_affiliation_string":"National Institutes of Health, Bethesda MD#TAB#","institution_ids":["https://openalex.org/I1299303238"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5046140110","display_name":"Balaji Raghavachari","orcid":null},"institutions":[{"id":"https://openalex.org/I162577319","display_name":"The University of Texas at Dallas","ror":"https://ror.org/049emcs32","country_code":"US","type":"education","lineage":["https://openalex.org/I162577319"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Balaji Raghavachari","raw_affiliation_strings":["University of Texas at Dallas, Richardson, TX","University of Texas at Dallas, Richardson, TX,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Texas at Dallas, Richardson, TX","institution_ids":["https://openalex.org/I162577319"]},{"raw_affiliation_string":"University of Texas at Dallas, Richardson, TX,","institution_ids":["https://openalex.org/I162577319"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3193,"has_fulltext":false,"cited_by_count":50,"citation_normalized_percentile":{"value":0.60674569,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"1","issue":"2","first_page":"265","last_page":"282"},"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.9883000254631042,"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.9883000254631042,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9882000088691711,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9854999780654907,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.7834160327911377},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7678420543670654},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.7023223638534546},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.692566454410553},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6901336312294006},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.6861160397529602},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.569892168045044},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.532141387462616},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.5201188325881958},{"id":"https://openalex.org/keywords/euclidean-minimum-spanning-tree","display_name":"Euclidean minimum spanning tree","score":0.5101871490478516},{"id":"https://openalex.org/keywords/inverse","display_name":"Inverse","score":0.49719908833503723},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.4420436918735504},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4414023458957672},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.39086881279945374},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3685923218727112},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.3632526099681854},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.2108362913131714},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.14981737732887268},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.09202980995178223}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.7834160327911377},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7678420543670654},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7023223638534546},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.692566454410553},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6901336312294006},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.6861160397529602},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.569892168045044},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.532141387462616},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.5201188325881958},{"id":"https://openalex.org/C145685049","wikidata":"https://www.wikidata.org/wiki/Q4454941","display_name":"Euclidean minimum spanning tree","level":4,"score":0.5101871490478516},{"id":"https://openalex.org/C207467116","wikidata":"https://www.wikidata.org/wiki/Q4385666","display_name":"Inverse","level":2,"score":0.49719908833503723},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.4420436918735504},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4414023458957672},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39086881279945374},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3685923218727112},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.3632526099681854},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.2108362913131714},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.14981737732887268},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.09202980995178223},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1103963.1103967","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1103963.1103967","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","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":49,"referenced_works":["https://openalex.org/W192592548","https://openalex.org/W272982077","https://openalex.org/W1482298744","https://openalex.org/W1484547884","https://openalex.org/W1570410091","https://openalex.org/W1963574949","https://openalex.org/W1964705035","https://openalex.org/W1964924757","https://openalex.org/W1972312685","https://openalex.org/W1972674272","https://openalex.org/W1982647060","https://openalex.org/W2001139415","https://openalex.org/W2006935476","https://openalex.org/W2011039300","https://openalex.org/W2012682597","https://openalex.org/W2017127755","https://openalex.org/W2019401519","https://openalex.org/W2025325419","https://openalex.org/W2025556735","https://openalex.org/W2027278505","https://openalex.org/W2044362812","https://openalex.org/W2052862856","https://openalex.org/W2056839231","https://openalex.org/W2059774914","https://openalex.org/W2064806410","https://openalex.org/W2069318500","https://openalex.org/W2074744922","https://openalex.org/W2075677840","https://openalex.org/W2088839217","https://openalex.org/W2103818573","https://openalex.org/W2104431850","https://openalex.org/W2104670598","https://openalex.org/W2108872758","https://openalex.org/W2114045721","https://openalex.org/W2124540286","https://openalex.org/W2139582537","https://openalex.org/W2139869884","https://openalex.org/W2141018803","https://openalex.org/W2152413298","https://openalex.org/W2157312425","https://openalex.org/W2164581054","https://openalex.org/W2174978036","https://openalex.org/W2599014521","https://openalex.org/W3142595608","https://openalex.org/W4210842697","https://openalex.org/W4246598646","https://openalex.org/W4285719527","https://openalex.org/W6634040485","https://openalex.org/W6746171443"],"related_works":["https://openalex.org/W2183553443","https://openalex.org/W1985149601","https://openalex.org/W1964611452","https://openalex.org/W2527517796","https://openalex.org/W3016811403","https://openalex.org/W1576317141","https://openalex.org/W3010374802","https://openalex.org/W2186461377","https://openalex.org/W4210544217","https://openalex.org/W1996106387"],"abstract_inverted_index":{"Given":[0],"an":[1,205],"undirected":[2],"graph":[3],"G":[4],"=":[5,327],"(":[6],"V,E":[7],")":[8],"with":[9,27,244,276,321],"nonnegative":[10],"costs":[11],"on":[12],"its":[13],"edges,":[14],"a":[15,21,43,57,143,254,268,314,358],"root":[16],"node":[17],"r":[18,40,63,72,87,343],"V":[19,26,96],",":[20,41,47,64,97,161],"set":[22],"of":[23,36,78,129,183,212,229,270,288,295,338,351,360],"demands":[24],"D":[25,30,69,94,248],"demand":[28],"v":[29],"wishing":[31],"to":[32,39,86,312,342,347],"route":[33],"w(v)":[34],"units":[35],"flow":[37],"(weight)":[38],"and":[42,112,127,162,221,231,325],"positive":[44],"number":[45],"k":[46,91,326,349,352],"the":[48,66,76,79,103,139,151,157,166,172,179,200,208,237,240,245,262,273,281,291,306,330,336,339],"Capacitated":[49,104],"Minimum":[50,105],"Steiner":[51,59,159,173],"Tree":[52,107],"(CMStT)":[53],"problem":[54,99,275,294],"asks":[55],"for":[56,124,150,171,188,199,214,261,272,302,316],"minimum":[58],"tree,":[60],"rooted":[61],"at":[62,89],"spanning":[65],"vertices":[67,246],"in":[68,74,82,132,219,236,247,280,318,334],"*":[70],"{":[71],"},":[73],"which":[75,203,335],"sum":[77],"vertex":[80,278,323],"weights":[81,279,324,337],"every":[83],"subtree":[84],"connected":[85,341],"is":[88,100,156,165,204],"most":[90],".":[92],"When":[93],"=":[95],"this":[98,118,189,215,303],"known":[101],"as":[102],"Spanning":[106],"(CMST)":[108],"problem.":[109,175,190,216,264],"Both":[110],"CMsT":[111],"CMST":[113,201,274,307,332],"problems":[114,126],"are":[115,138],"NP-hard.":[116],"In":[117],"article,":[119],"we":[120,193,252,309,356],"present":[121,142,253],"approximation":[122,169],"algorithms":[123],"these":[125],"several":[128],"their":[130],"variants":[131],"network":[133],"design.":[134],"Our":[135,176,286],"main":[136],"results":[137],"following:":[140],"---We":[141],"(\u00b3":[144,195],"\u00c1":[145,163],"ST":[146,164,185,257],"+":[147,186,196,258],"2)-approximation":[148,197],"algorithm":[149,260],"CMStT":[152,263],"problem,":[153,202,308,333],"where":[154],"\u00b3":[155,361],"inverse":[158],"ratio":[160,170,177,182,198,211,269,287,298,359],"best":[167,181,210],"achievable":[168],"tree":[174],"improves":[178],"current":[180,209],"2\u00c1":[184],"2":[187],"---In":[191],"particular,":[192],"obtain":[194,313,357],"improvement":[206],"over":[207],"4":[213],"For":[217],"points":[218],"Euclidean":[220],"rectilinear":[222],"planes,":[223],"our":[224],"result":[225],"translates":[226,266],"into":[227,267],"ratios":[228],"3.1548":[230],"3.5,":[232],"respectively.":[233],"---For":[234,305,329],"instances":[235],"plane,":[238],"under":[239],"L":[241,282],"p":[242,283],"norm,":[243],"having":[249],"uniform":[250,277],"weights,":[251],"nontrivial":[255],"(7/5\u00c1":[256],"3/2)-approximation":[259],"This":[265],"2.9":[271,289],"metric":[284,319],"plane.":[285],"solves":[290],"long-standing":[292],"open":[293],"obtaining":[296],"any":[297],"better":[299],"than":[300],"3":[301],"case.":[304],"show":[310],"how":[311],"2-approximation":[315],"graphs":[317],"spaces":[320],"unit":[322],"3,4.":[328],"budgeted":[331],"subtrees":[340],"could":[344],"be":[345],"up":[346],"\u00b1":[348],"instead":[350],"(\u00b1":[353],"e":[354],"1),":[355],"+":[362],"2/\u00b1.":[363]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":6}],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-10-10T00:00:00"}