{"id":"https://openalex.org/W2004163233","doi":"https://doi.org/10.1145/2629366","title":"Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal","display_name":"Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal","publication_year":2015,"publication_date":"2015-03-02","ids":{"openalex":"https://openalex.org/W2004163233","doi":"https://doi.org/10.1145/2629366","mag":"2004163233"},"language":"en","primary_location":{"id":"doi:10.1145/2629366","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2629366","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"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":"Journal of the ACM","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/A5020914506","display_name":"Mohit Singh","orcid":"https://orcid.org/0000-0002-0827-233X"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Mohit Singh","raw_affiliation_strings":["Microsoft Research, Redmond, WA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research, Redmond, WA","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5008440961","display_name":"Lap Chi Lau","orcid":null},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"HK","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Lap Chi Lau","raw_affiliation_strings":["The Chinese University of Hong Kong, Shatin, Hong Kong"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Chinese University of Hong Kong, Shatin, Hong Kong","institution_ids":["https://openalex.org/I177725633"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5020914506"],"corresponding_institution_ids":["https://openalex.org/I1290206253"],"apc_list":null,"apc_paid":null,"fwci":5.4507,"has_fulltext":false,"cited_by_count":62,"citation_normalized_percentile":{"value":0.96117969,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"62","issue":"1","first_page":"1","last_page":"19"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9983000159263611,"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"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9948999881744385,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/combinatorics","display_name":"Combinatorics","score":0.8805038928985596},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7624344825744629},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.7524569034576416},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.7524318695068359},{"id":"https://openalex.org/keywords/rounding","display_name":"Rounding","score":0.6611934900283813},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.6378012895584106},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.633906364440918},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.6288676261901855},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5781219005584717},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5766453146934509},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.553939163684845},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.5466896891593933},{"id":"https://openalex.org/keywords/shortest-path-tree","display_name":"Shortest-path tree","score":0.4999666213989258},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.49988484382629395},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4356112480163574},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4205377697944641},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.3028373122215271},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.1428314745426178},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.12644609808921814},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.08563512563705444}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8805038928985596},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7624344825744629},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7524569034576416},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.7524318695068359},{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.6611934900283813},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.6378012895584106},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.633906364440918},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.6288676261901855},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5781219005584717},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5766453146934509},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.553939163684845},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.5466896891593933},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.4999666213989258},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.49988484382629395},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4356112480163574},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4205377697944641},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.3028373122215271},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.1428314745426178},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.12644609808921814},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.08563512563705444},{"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},{"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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/2629366","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2629366","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"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":"Journal of the ACM","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.123.9668","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.123.9668","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/mbdst.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.433.674","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.433.674","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/mbdst.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320308943","display_name":"Microsoft Research","ror":"https://ror.org/00d0nc645"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1968690018","https://openalex.org/W1975884818","https://openalex.org/W1976459503","https://openalex.org/W1991528957","https://openalex.org/W2002764437","https://openalex.org/W2009946412","https://openalex.org/W2011039300","https://openalex.org/W2012329067","https://openalex.org/W2055505431","https://openalex.org/W2060807538","https://openalex.org/W2063807274","https://openalex.org/W2066700938","https://openalex.org/W2080656989","https://openalex.org/W2083210138","https://openalex.org/W2083383617","https://openalex.org/W2099338166","https://openalex.org/W2112594285","https://openalex.org/W2161190897","https://openalex.org/W2172955861","https://openalex.org/W2176322034","https://openalex.org/W2552451242","https://openalex.org/W2611804663","https://openalex.org/W2988480584","https://openalex.org/W4300550233"],"related_works":["https://openalex.org/W4308416203","https://openalex.org/W1985149601","https://openalex.org/W620960161","https://openalex.org/W2071845176","https://openalex.org/W2911818503","https://openalex.org/W2039611868","https://openalex.org/W1576317141","https://openalex.org/W2045244794","https://openalex.org/W2621339359","https://openalex.org/W1958279402"],"abstract_inverted_index":{"In":[0,64],"the":[1,35,49,55,105,189,200,209],"Minimum":[2],"Bounded":[3],"Degree":[4],"Spanning":[5],"Tree":[6],"problem,":[7],"we":[8,67],"are":[9],"given":[10],"an":[11,58,197],"undirected":[12],"graph":[13],"G":[14],"=":[15],"(":[16,86,101,172],"V,":[17],"E":[18],")":[19,88,103,174],"with":[20,159],"a":[21,40,69,74,114,126,140,147,156],"degree":[22,50,106,141,148],"upper":[23,149],"bound":[24,143,150],"B":[25,90,151,176],"v":[26,30,87,91,96,102,108,138,145,152,166,173,177,182],"on":[27],"each":[28,136],"vertex":[29,137],"\u2208":[31,183],"V":[32,184],",":[33,97,153],"and":[34,83,118,124,146,154,164],"task":[36],"is":[37,187,196],"to":[38,61,121],"find":[39],"spanning":[41,75,157],"tree":[42,76,158],"of":[43,57,78,107,116,128,199,211],"minimum":[44],"cost":[45,56,79,160],"that":[46],"satisfies":[47],"all":[48,95,181],"bounds.":[51],"Let":[52],"OPT":[53,82,163],"be":[54],"optimal":[59],"solution":[60],"this":[62,65],"problem.":[63],"article":[66],"present":[68],"polynomial-time":[70],"algorithm":[71,133],"which":[72],"returns":[73,155],"T":[77,85,100,110,171],"at":[80,161],"most":[81,162],"d":[84,99,170],"\u2264":[89,169,175],"+":[92,178],"1":[93,168,179],"for":[94,180,208],"where":[98],"denotes":[104],"in":[109],".":[111,185],"This":[112,186],"generalizes":[113,134],"result":[115],"F\u00fcrer":[117],"Raghavachari":[119],"[1994]":[120],"weighted":[122],"graphs,":[123],"settles":[125],"conjecture":[127],"Goemans":[129],"[2006]":[130],"affirmatively.":[131],"The":[132,192],"when":[135],"has":[139],"lower":[142],"A":[144,165],"-":[167],"essentially":[188],"best":[190],"possible.":[191],"main":[193],"technique":[194],"used":[195],"extension":[198],"iterative":[201],"rounding":[202],"method":[203],"introduced":[204],"by":[205],"Jain":[206],"[2001]":[207],"design":[210],"approximation":[212],"algorithms.":[213]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":7},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":13},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}