{"id":"https://openalex.org/W2078327767","doi":"https://doi.org/10.1007/bf02679617","title":"Near-optimal bounded-degree spanning trees","display_name":"Near-optimal bounded-degree spanning trees","publication_year":2001,"publication_date":"2001-02-01","ids":{"openalex":"https://openalex.org/W2078327767","doi":"https://doi.org/10.1007/bf02679617","mag":"2078327767"},"language":"en","primary_location":{"id":"doi:10.1007/bf02679617","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf02679617","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/A5000420164","display_name":"Jennie C. Hansen","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"J. C. Hansen","raw_affiliation_strings":["Department of Actuarial Mathematics and Statistics, Heriot-Watt University, Edinburgh, Scotland"],"affiliations":[{"raw_affiliation_string":"Department of Actuarial Mathematics and Statistics, Heriot-Watt University, Edinburgh, Scotland","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5048043622","display_name":"Eric Schmutz","orcid":null},"institutions":[{"id":"https://openalex.org/I72816309","display_name":"Drexel University","ror":"https://ror.org/04bdffz58","country_code":"US","type":"education","lineage":["https://openalex.org/I72816309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"E. Schmutz","raw_affiliation_strings":["Department of Mathematics and Computer Science, Drexel University, 19104, Philadelphia, PA, USA","Dept. of Mathematics and Computer Science, Drexel University, Philadelphia, USA"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Drexel University, 19104, Philadelphia, PA, USA","institution_ids":["https://openalex.org/I72816309"]},{"raw_affiliation_string":"Dept. of Mathematics and Computer Science, Drexel University, Philadelphia, USA","institution_ids":["https://openalex.org/I72816309"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5000420164"],"corresponding_institution_ids":[],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.3992,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.65715521,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"29","issue":"1-2","first_page":"148","last_page":"180"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11152","display_name":"Stochastic processes and statistical mechanics","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/2610","display_name":"Mathematical Physics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11476","display_name":"Graph theory and applications","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8459771275520325},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.7703951597213745},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.6959484219551086},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6891525983810425},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.6767629981040955},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.6214372515678406},{"id":"https://openalex.org/keywords/shortest-path-tree","display_name":"Shortest-path tree","score":0.5125691890716553},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5099529027938843},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.47358113527297974},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4677315652370453},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.45810556411743164},{"id":"https://openalex.org/keywords/fork","display_name":"Fork (system call)","score":0.41518086194992065},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.4146958291530609},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.13499438762664795},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.12977299094200134},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.09640374779701233}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8459771275520325},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7703951597213745},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.6959484219551086},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6891525983810425},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.6767629981040955},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.6214372515678406},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.5125691890716553},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5099529027938843},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.47358113527297974},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4677315652370453},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.45810556411743164},{"id":"https://openalex.org/C40523978","wikidata":"https://www.wikidata.org/wiki/Q14675","display_name":"Fork (system call)","level":2,"score":0.41518086194992065},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.4146958291530609},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.13499438762664795},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.12977299094200134},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.09640374779701233},{"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/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","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}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/bf02679617","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf02679617","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.101.6699","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.101.6699","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ma.hw.ac.uk/~jennie/papers/final.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.543.7352","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.543.7352","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.drexel.edu/~eschmutz/PAPERS/dmst.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W249091067","https://openalex.org/W1496592812","https://openalex.org/W1551519020","https://openalex.org/W1980848544","https://openalex.org/W1995407307","https://openalex.org/W2010997912","https://openalex.org/W2016592053","https://openalex.org/W2017052287","https://openalex.org/W2028955990","https://openalex.org/W2038646960","https://openalex.org/W2052882549","https://openalex.org/W2054812794","https://openalex.org/W2055762112","https://openalex.org/W2142946851","https://openalex.org/W2167579893","https://openalex.org/W2920966226","https://openalex.org/W3099328339","https://openalex.org/W3106209630"],"related_works":["https://openalex.org/W2149927264","https://openalex.org/W4308416203","https://openalex.org/W2099915933","https://openalex.org/W2307044859","https://openalex.org/W4220861011","https://openalex.org/W2047517090","https://openalex.org/W1991421283","https://openalex.org/W3141326665","https://openalex.org/W2041764189","https://openalex.org/W2014991506"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}