{"id":"https://openalex.org/W2005362242","doi":"https://doi.org/10.5555/313559.313760","title":"Balancing minimum spanning and shortest path trees","display_name":"Balancing minimum spanning and shortest path trees","alternate_titles":[],"publication_year":1993,"publication_date":"1993-01-01","ids":{"openalex":"https://openalex.org/W2005362242","doi":"https://doi.org/10.5555/313559.313760","mag":"2005362242"},"language":"en","primary_location":{"id":"mag:2005362242","doi":"https://doi.org/10.5555/313559.313760","is_oa":false,"landing_page_url":"https://www.cs.ucr.edu/~neal/Khuller93Balancing.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306420974","display_name":"Symposium on Discrete Algorithms","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Symposium on Discrete Algorithms","raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W2005362242"],"child_works_count":0,"type":"conference-paper","is_traditional":true,"indexed_in":[],"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/A5042716179","display_name":"Samir Khuller","orcid":"https://orcid.org/0000-0002-5408-8023","observed_orcids":["https://orcid.org/0000-0002-5408-8023"]},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Samir Khuller","raw_affiliation_strings":["Computer Science Dept, University of Maryland, College Park, MD#TAB#"],"raw_orcid":"https://orcid.org/0000-0002-5408-8023","affiliations":[{"raw_affiliation_string":"Computer Science Dept, University of Maryland, College Park, MD#TAB#","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5046140110","display_name":"Balaji Raghavachari","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I130769515","display_name":"Pennsylvania State University","ror":"https://ror.org/04p491231","country_code":"US","type":"education","lineage":["https://openalex.org/I130769515"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Balaji Raghavachari","raw_affiliation_strings":["Computer Science Department, Pennsylvania State University, University Park, PA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, Pennsylvania State University, University Park, PA","institution_ids":["https://openalex.org/I130769515"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5006234305","display_name":"Neal E. Young","orcid":"https://orcid.org/0000-0001-8144-3345","observed_orcids":["https://orcid.org/0000-0001-8144-3345"]},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Neal E. Young","raw_affiliation_strings":["University of Maryland, Institute for Advanced Computer Studies, College Park, MD#TAB#"],"raw_orcid":"https://orcid.org/0000-0001-8144-3345","affiliations":[{"raw_affiliation_string":"University of Maryland, Institute for Advanced Computer Studies, College Park, MD#TAB#","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.9376,"has_fulltext":false,"cited_by_count":61,"citation_normalized_percentile":{"value":0.83600713,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":87,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"243","last_page":"250"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":1.0,"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":1.0,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.0,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.0,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"minimum spanning tree","score":0.8339999914169312},{"id":"https://openalex.org/keywords/shortest-path-tree","display_name":"shortest path tree","score":0.9929999709129333},{"id":"https://openalex.org/keywords/tree-approximation","display_name":"tree approximation","score":0.5130000114440918},{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":0.49900001287460327},{"id":"https://openalex.org/keywords/parallel-algorithms","display_name":"parallel algorithms","score":0.6890000104904175},{"id":"https://openalex.org/keywords/np-hardness","display_name":"NP-hardness","score":0.871999979019165},{"id":"https://openalex.org/keywords/approximation-lower-bounds","display_name":"approximation lower bounds","score":0.5450000166893005},{"id":"https://openalex.org/keywords/graph-distance","display_name":"graph distance","score":0.36000001430511475}],"concepts":[{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.7969778776168823},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7385578751564026},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6826798915863037},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6551388502120972},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.6099047064781189},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.5537847876548767},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5513826608657837},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.5323524475097656},{"id":"https://openalex.org/C199346575","wikidata":"https://www.wikidata.org/wiki/Q4925151","display_name":"Reverse-delete algorithm","level":4,"score":0.5205532312393188},{"id":"https://openalex.org/C1649724","wikidata":"https://www.wikidata.org/wiki/Q470813","display_name":"Prim's algorithm","level":4,"score":0.5136305689811707},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4894517958164215},{"id":"https://openalex.org/C145685049","wikidata":"https://www.wikidata.org/wiki/Q4454941","display_name":"Euclidean minimum spanning tree","level":4,"score":0.4753548800945282},{"id":"https://openalex.org/C147517495","wikidata":"https://www.wikidata.org/wiki/Q5581241","display_name":"Gomory\u2013Hu tree","level":5,"score":0.4745182394981384},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.4414815902709961},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.42994025349617004},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.420324444770813},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.4160318374633789},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40754061937332153},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.39792928099632263},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.21959072351455688},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.05978405475616455}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2005362242","doi":"https://doi.org/10.5555/313559.313760","is_oa":false,"landing_page_url":"https://www.cs.ucr.edu/~neal/Khuller93Balancing.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306420974","display_name":"Symposium on Discrete Algorithms","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Symposium on Discrete Algorithms","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1489900072","https://openalex.org/W1965680834","https://openalex.org/W1982512167","https://openalex.org/W2002041206","https://openalex.org/W2017927472","https://openalex.org/W2029772672","https://openalex.org/W2041167985","https://openalex.org/W2050855807","https://openalex.org/W2055488252","https://openalex.org/W2084224084","https://openalex.org/W2106718857","https://openalex.org/W2118095775","https://openalex.org/W2120490947","https://openalex.org/W2139391136","https://openalex.org/W2141105412","https://openalex.org/W2144677702","https://openalex.org/W2151250580","https://openalex.org/W2169528473","https://openalex.org/W2752885492"],"related_works":["https://openalex.org/W7098166184","https://openalex.org/W1492843964","https://openalex.org/W2107691209","https://openalex.org/W1898478360","https://openalex.org/W1859219047","https://openalex.org/W2081860686","https://openalex.org/W2323566888","https://openalex.org/W1601487505","https://openalex.org/W2268947952","https://openalex.org/W2400222470"],"abstract_inverted_index":{"Efficient":[0,196],"algorithms":[1,200,207],"are":[2,204,208],"known":[3],"for":[4],"computing":[5],"a":[6,11,16,25,37,51,84,91,117,137,151,169,247],"minimum":[7,38,52,97,170],"spann.ing":[8],"tree,":[9,172],"or":[10],"shortest":[12,26],"path.":[13],"tree":[14,28,54,85,112,152,179],"(with":[15],"fixed":[17],"vertex":[18,49,109,185],"as":[19],"the":[20,34,42,45,60,63,67,70,75,96,102,105,120,126,129,141,154,166,175,178,181,193],"root).":[21],"The":[22,206],"weight":[23,35,158,167],"of":[24,36,72,78,168],"path":[27],"can":[29,223],"be":[30,56,211],"much":[31,57],"more":[32,58,115],"than":[33,59,95,116],"spa,nning":[39],"tree.":[40],"Conversely,":[41],"distance":[43,61,103],"bet,ween":[44],"root,":[46,182],"and":[47,183,198],"any":[48,108,184],"in":[50,66,110,128,153,177,213,227],"spanning":[53,98,171],"may":[55],"bet#ween":[62],"two":[64,76,142,214],"vertices":[65],"graph.":[68],"Consider":[69],"problem":[71],"balancing":[73],"between":[74,140,180],"kinds":[77],"trees:":[79],"Does":[80],"every":[81,145],"graph":[82,155],"contain":[83],"that":[86,101,134,174,220,234,244,252],"is":[87,113,132,136,150,159,186,218,242,256],"\u201clight\u201d":[88],"(at":[89],"most":[90,161,188],"constant":[92,118],"times":[93,119,165,192],"heavier":[94],"t,ree),":[99],"such":[100,173],"from":[104],"root":[106],"to":[107,210],"t,he":[111],"no":[114,221],"true":[121,194],"distance?":[122],"This":[123],"paper":[124],"answers":[125],"question":[127],"affirmative.":[130],"It":[131],"shown":[133,209,219,243],"there":[135,149,231],"continuous":[138],"tradeoff":[139],"parameters.":[143],"For":[144],"y":[146],">":[147],"0,":[148],"whose":[156],"total":[157],"at":[160],"1":[162,189],"+":[163,190],"$?":[164],"di&nce":[176],"at,":[187],"&y":[191],"distance.":[195],"sequential":[197],"parallel":[199],"achieving":[201],"these":[202],"factors":[203,226,255],"provided.":[205],"optimal":[212],"ways.":[215],"First,":[216],"it":[217,241],"algorithm":[222],"achieve":[224,253],"better":[225,238,254],"all":[228],"graphs,":[229],"because":[230],"a.re":[232],"graphs":[233],"do":[235],"not":[236],"have":[237],"trees.":[239],"Second,":[240],"even":[245],"on":[246],"per-graph":[248],"basis,":[249],"finding":[250],"trees":[251],"NP-hard.":[257]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2005362242","counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2016-06-24T00:00:00"}
