{"id":"https://openalex.org/W3138832177","doi":"https://doi.org/10.1137/s009753979732253x","title":"A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees","display_name":"A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W3138832177","doi":"https://doi.org/10.1137/s009753979732253x","mag":"3138832177"},"language":"en","primary_location":{"id":"doi:10.1137/s009753979732253x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s009753979732253x","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/A5012701826","display_name":"Bang Ye Wu","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Bang Ye Wu","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5090463247","display_name":"Giuseppe Lancia","orcid":"https://orcid.org/0000-0001-5323-8483"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Giuseppe Lancia","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5028801735","display_name":"Vineet Bafna","orcid":"https://orcid.org/0000-0002-5810-6241"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Vineet Bafna","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5033888490","display_name":"Kun\u2010Mao Chao","orcid":"https://orcid.org/0000-0003-2837-1279"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kun-Mao Chao","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","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":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5101474162","display_name":"Chuan Yi Tang","orcid":"https://orcid.org/0000-0003-0729-1624"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chuan Yi Tang","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":6,"corresponding_author_ids":["https://openalex.org/A5012701826"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.5096,"has_fulltext":false,"cited_by_count":130,"citation_normalized_percentile":{"value":0.89742437,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"29","issue":"3","first_page":"761","last_page":"778"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10207","display_name":"Advanced biosensing and bioanalysis techniques","score":0.9948999881744385,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},"topics":[{"id":"https://openalex.org/T10207","display_name":"Advanced biosensing and bioanalysis techniques","score":0.9948999881744385,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.98089998960495,"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/T11478","display_name":"Caching and Content Delivery","score":0.9729999899864197,"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/spanning-tree","display_name":"Spanning tree","score":0.7405825853347778},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6938512921333313},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.6829763054847717},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.664577066898346},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6146939992904663},{"id":"https://openalex.org/keywords/shortest-path-tree","display_name":"Shortest-path tree","score":0.5890604257583618},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.5793183445930481},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.510101854801178},{"id":"https://openalex.org/keywords/triangle-inequality","display_name":"Triangle inequality","score":0.47875919938087463},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4725325405597687},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.46883076429367065},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4369436800479889},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.43516603112220764},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.41606035828590393},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4146650433540344},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.35186895728111267},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.31239134073257446},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2323693335056305},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.20364350080490112},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.1322641372680664}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7405825853347778},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6938512921333313},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.6829763054847717},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.664577066898346},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6146939992904663},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.5890604257583618},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.5793183445930481},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.510101854801178},{"id":"https://openalex.org/C182964748","wikidata":"https://www.wikidata.org/wiki/Q208216","display_name":"Triangle inequality","level":2,"score":0.47875919938087463},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4725325405597687},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.46883076429367065},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4369436800479889},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.43516603112220764},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.41606035828590393},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4146650433540344},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.35186895728111267},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.31239134073257446},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2323693335056305},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.20364350080490112},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.1322641372680664},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/s009753979732253x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s009753979732253x","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:repositorio.unal.edu.co:unal/80050","is_oa":false,"landing_page_url":"https://repositorio.unal.edu.co/handle/unal/80050","pdf_url":null,"source":{"id":"https://openalex.org/S4306402641","display_name":"LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Cient\u00edficas)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4383465926","host_organization_name":"LA Referencia","host_organization_lineage":["https://openalex.org/I4383465926"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"reponame:Repositorio UN","raw_type":"Trabajo de grado - Maestr\u00eda"},{"id":"pmh:oai:air.uniud.it:11390/1195241","is_oa":false,"landing_page_url":"http://hdl.handle.net/11390/1195241","pdf_url":null,"source":{"id":"https://openalex.org/S4306401163","display_name":"Institutional Research Information System (University of Udine)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I129043915","host_organization_name":"University of Udine","host_organization_lineage":["https://openalex.org/I129043915"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1501400124","https://openalex.org/W1969153299","https://openalex.org/W1973297532","https://openalex.org/W1974326986","https://openalex.org/W1987663950","https://openalex.org/W1998139877","https://openalex.org/W2002638840","https://openalex.org/W2016218947","https://openalex.org/W2018128607","https://openalex.org/W2047517090","https://openalex.org/W2074231493","https://openalex.org/W2105516199","https://openalex.org/W2888871578","https://openalex.org/W4234838399","https://openalex.org/W4255011371"],"related_works":["https://openalex.org/W2943635264","https://openalex.org/W193918669","https://openalex.org/W620960161","https://openalex.org/W2071845176","https://openalex.org/W2005362242","https://openalex.org/W1576317141","https://openalex.org/W2408068853","https://openalex.org/W2045244794","https://openalex.org/W2256978550","https://openalex.org/W2621339359"],"abstract_inverted_index":{"Given":[0],"an":[1,95],"undirected":[2],"graph":[3,98],"with":[4,99,120],"nonnegative":[5],"costs":[6,52,157],"on":[7],"the":[8,10,20,28,31,34,37,51,54,60,68,82,106,113,128,148,155,191,202,206],"edges,":[9],"routing":[11,45,100,122,150,156],"cost":[12,29,46,101,123,140,151],"of":[13,15,25,27,30,43,81,94,105,130,147,158,186,193],"any":[14],"its":[16],"spanning":[17,41,92,141],"trees":[18,119],"is":[19,47,63,144,190],"sum":[21],"over":[22],"all":[23],"pairs":[24,160],"vertices":[26],"path":[32],"between":[33],"pair":[35],"in":[36,64,108,127,135,195,211],"tree.":[38],"Finding":[39],"a":[40,73,91,145,170,183,196],"tree":[42,93,142,152],"minimum":[44,107,149],"NP-hard,":[48],"even":[49],"when":[50],"obey":[53],"triangle":[55],"inequality.":[56],"We":[57,167],"show":[58,87],"that":[59,169],"general":[61],"case":[62,70],"fact":[65],"reducible":[66],"to":[67,89,116],"metric":[69,197],"and":[71],"present":[72],"polynomial-time":[74],"approximation":[75,204],"scheme":[76],"valid":[77],"for":[78,177,205],"both":[79],"versions":[80],"problem.":[83],"In":[84],"particular,":[85],"we":[86],"how":[88],"build":[90],"n-vertex":[96],"weighted":[97,162],"at":[102],"most":[103],"$(1+\\epsilon)$":[104],"time":[109],"$O(n^{O({\\frac{1}{\\epsilon}}%":[110],")})$.":[111],"Besides":[112],"obvious":[114],"connection":[115],"network":[117],"design,":[118],"small":[121],"also":[124,200],"find":[125],"application":[126],"construction":[129],"good":[131],"multiple":[132],"sequence":[133],"alignments":[134],"computational":[136,212],"biology.":[137,213],"The":[138],"communication":[139],"problem":[143,153,179,210],"generalization":[146],"where":[154,188],"different":[159,164],"are":[161],"by":[163],"requirement":[165],"amounts.":[166],"observe":[168],"randomized":[171],"O(log":[172],"n":[173,189],"log":[174,175],"n)-approximation":[176],"this":[178],"follows":[180],"directly":[181],"from":[182],"recent":[184],"result":[185],"Bartal,":[187],"number":[192],"nodes":[194],"graph.":[198],"This":[199],"yields":[201],"same":[203],"generalized":[207],"sum-of-pairs":[208],"alignment":[209]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}