{"id":"https://openalex.org/W1492843964","doi":"https://doi.org/10.1007/bf01294129","title":"Balancing minimum spanning trees and shortest-path trees","display_name":"Balancing minimum spanning trees and shortest-path trees","publication_year":1995,"publication_date":"1995-10-01","ids":{"openalex":"https://openalex.org/W1492843964","doi":"https://doi.org/10.1007/bf01294129","mag":"1492843964"},"language":"en","primary_location":{"id":"doi:10.1007/bf01294129","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01294129","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","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/A5042716179","display_name":"Samir Khuller","orcid":"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":"S. Khuller","raw_affiliation_strings":["Department of Computer Science and Institute for Advanced Computer Studies, University of Maryland, 20742, College Park, MD, USA","Department of Computer Science and Institute for Advanced Computer Studies, University of Maryland, College Park, USA 20742"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Institute for Advanced Computer Studies, University of Maryland, 20742, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]},{"raw_affiliation_string":"Department of Computer Science and Institute for Advanced Computer Studies, University of Maryland, College Park, USA 20742","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"middle","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":"B. Raghavachari","raw_affiliation_strings":["Department of Computer Science, University of Texas at Dallas, Box 830688, 75083-0688, Richardson, TX, USA","Department of Computer Science, University of Texas at Dallas, Richardson, USA 75083-0688#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Texas at Dallas, Box 830688, 75083-0688, Richardson, TX, USA","institution_ids":["https://openalex.org/I162577319"]},{"raw_affiliation_string":"Department of Computer Science, University of Texas at Dallas, Richardson, USA 75083-0688#TAB#","institution_ids":["https://openalex.org/I162577319"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5006234305","display_name":"Neal E. Young","orcid":"https://orcid.org/0000-0001-8144-3345"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"N. Young","raw_affiliation_strings":["Department of Computer Science, Princeton University, 08544, Princeton, NJ, USA","Department of Computer Science, Princeton University, Princeton, USA 08544#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Princeton University, 08544, Princeton, NJ, USA","institution_ids":["https://openalex.org/I20089843"]},{"raw_affiliation_string":"Department of Computer Science, Princeton University, Princeton, USA 08544#TAB#","institution_ids":["https://openalex.org/I20089843"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.06263188,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"14","issue":"4","first_page":"305","last_page":"321"},"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.46389999985694885,"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.46389999985694885,"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.1501999944448471,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.05220000073313713,"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/shortest-path-tree","display_name":"Shortest-path tree","score":0.8271011114120483},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.80802321434021},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.7362204194068909},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6313869953155518},{"id":"https://openalex.org/keywords/distributed-minimum-spanning-tree","display_name":"Distributed minimum spanning tree","score":0.6220600605010986},{"id":"https://openalex.org/keywords/prims-algorithm","display_name":"Prim's algorithm","score":0.6033170819282532},{"id":"https://openalex.org/keywords/reverse-delete-algorithm","display_name":"Reverse-delete algorithm","score":0.5943254828453064},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.567232072353363},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5427728891372681},{"id":"https://openalex.org/keywords/euclidean-minimum-spanning-tree","display_name":"Euclidean minimum spanning tree","score":0.5206155776977539},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5070517063140869},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5037009119987488},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.47245219349861145},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.47086894512176514},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.4635915160179138},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.423711359500885},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.41275644302368164},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.3933652341365814},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.20352396368980408},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.1599985957145691},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.15918421745300293},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.07249751687049866}],"concepts":[{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.8271011114120483},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.80802321434021},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.7362204194068909},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6313869953155518},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.6220600605010986},{"id":"https://openalex.org/C1649724","wikidata":"https://www.wikidata.org/wiki/Q470813","display_name":"Prim's algorithm","level":4,"score":0.6033170819282532},{"id":"https://openalex.org/C199346575","wikidata":"https://www.wikidata.org/wiki/Q4925151","display_name":"Reverse-delete algorithm","level":4,"score":0.5943254828453064},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.567232072353363},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5427728891372681},{"id":"https://openalex.org/C145685049","wikidata":"https://www.wikidata.org/wiki/Q4454941","display_name":"Euclidean minimum spanning tree","level":4,"score":0.5206155776977539},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5070517063140869},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5037009119987488},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.47245219349861145},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.47086894512176514},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.4635915160179138},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.423711359500885},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.41275644302368164},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.3933652341365814},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.20352396368980408},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.1599985957145691},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.15918421745300293},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.07249751687049866},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1007/bf01294129","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01294129","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.126.5066","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.126.5066","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.utdallas.edu/~rbk/papers/mstSpt.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.126.9705","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.126.9705","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.ucr.edu/~neal/non_arxiv/algorithmica_1995_14_4_305.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.135.7489","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.135.7489","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.umd.edu/users/samir/grant/kry93a.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.28.4469","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.28.4469","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.drenchedrock.net/neal_academic/papers/LAST/LAST.ps","raw_type":"text"},{"id":"pmh:oai:escholarship.org/ark:/13030/qt5v41c1r6","is_oa":false,"landing_page_url":"https://escholarship.org/uc/item/5v41c1r6","pdf_url":null,"source":{"id":"https://openalex.org/S4306400115","display_name":"eScholarship (California Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2801248553","host_organization_name":"California Digital Library","host_organization_lineage":["https://openalex.org/I2801248553"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithmica, vol 14, iss 4","raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["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","https://openalex.org/W2911302472"],"related_works":["https://openalex.org/W2951475756","https://openalex.org/W2071845176","https://openalex.org/W2466376001","https://openalex.org/W2144677702","https://openalex.org/W1491195793","https://openalex.org/W2094865430","https://openalex.org/W3047479057","https://openalex.org/W1576317141","https://openalex.org/W2506289094","https://openalex.org/W2396379829","https://openalex.org/W1571815623","https://openalex.org/W3187208706","https://openalex.org/W2092979316","https://openalex.org/W1965810411","https://openalex.org/W3010374802","https://openalex.org/W2331692892","https://openalex.org/W2379753072","https://openalex.org/W88291963","https://openalex.org/W1983511657"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-19T15:47:20.252518","created_date":"2025-10-10T00:00:00"}