{"id":"https://openalex.org/W2031153755","doi":"https://doi.org/10.1007/bf01762131","title":"On finding optimal and near-optimal lineal spanning trees","display_name":"On finding optimal and near-optimal lineal spanning trees","publication_year":1988,"publication_date":"1988-11-01","ids":{"openalex":"https://openalex.org/W2031153755","doi":"https://doi.org/10.1007/bf01762131","mag":"2031153755"},"language":"en","primary_location":{"id":"doi:10.1007/bf01762131","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01762131","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/A5054676766","display_name":"Michael R. Fellows","orcid":"https://orcid.org/0000-0002-6148-9212"},"institutions":[{"id":"https://openalex.org/I155093810","display_name":"University of Idaho","ror":"https://ror.org/03hbp5t65","country_code":"US","type":"education","lineage":["https://openalex.org/I155093810"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Michael R. Fellows","raw_affiliation_strings":["Department of Computer Science, University of Idaho, 83843, Moscow, ID, USA","Department of Computer Science, University of Idaho, Moscow, USA 83843#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Idaho, 83843, Moscow, ID, USA","institution_ids":["https://openalex.org/I155093810"]},{"raw_affiliation_string":"Department of Computer Science, University of Idaho, Moscow, USA 83843#TAB#","institution_ids":["https://openalex.org/I155093810"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5059076709","display_name":"Donald K. Friesen","orcid":null},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Donald K. Friesen","raw_affiliation_strings":["Department of Computer Science, Texas A&M University, 77840, College Station, TX, USA","Department of Computer Science, Texas A&M University, College Station, USA 77840#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Texas A&M University, 77840, College Station, TX, USA","institution_ids":["https://openalex.org/I91045830"]},{"raw_affiliation_string":"Department of Computer Science, Texas A&M University, College Station, USA 77840#TAB#","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5011863644","display_name":"Michael A. Langston","orcid":"https://orcid.org/0000-0001-5945-5796"},"institutions":[{"id":"https://openalex.org/I72951846","display_name":"Washington State University","ror":"https://ror.org/05dk0ce17","country_code":"US","type":"education","lineage":["https://openalex.org/I72951846"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Michael A. Langston","raw_affiliation_strings":["Department of Computer Science, Washington State University, 99164-1210, Pullman, WA, USA","Department of Computer Science, Washington State University, Pullman, USA 99164-1210#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Washington State University, 99164-1210, Pullman, WA, USA","institution_ids":["https://openalex.org/I72951846"]},{"raw_affiliation_string":"Department of Computer Science, Washington State University, Pullman, USA 99164-1210#TAB#","institution_ids":["https://openalex.org/I72951846"]}]}],"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":1.0043,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.78800522,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"3","issue":"1-4","first_page":"549","last_page":"560"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9998999834060669,"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/T11106","display_name":"Data Management and Algorithms","score":0.996999979019165,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.9941999912261963,"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/spanning-tree","display_name":"Spanning tree","score":0.7580891847610474},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.6866479516029358},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.6060492992401123},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5708818435668945},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.450374960899353},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.43859779834747314},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.4364210069179535},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4163414239883423},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.41295135021209717},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3503532409667969},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.33420777320861816},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.26403576135635376},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.1788794994354248},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.16496169567108154},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.10950446128845215}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7580891847610474},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.6866479516029358},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.6060492992401123},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5708818435668945},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.450374960899353},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.43859779834747314},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.4364210069179535},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4163414239883423},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.41295135021209717},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3503532409667969},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.33420777320861816},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26403576135635376},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.1788794994354248},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.16496169567108154},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.10950446128845215}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/bf01762131","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01762131","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1796344988","https://openalex.org/W1987374783","https://openalex.org/W1998776409","https://openalex.org/W2007923771","https://openalex.org/W2011039300","https://openalex.org/W2016168355","https://openalex.org/W2053913299","https://openalex.org/W2054924988","https://openalex.org/W2068852367","https://openalex.org/W2086301589","https://openalex.org/W2113358778","https://openalex.org/W2212036697","https://openalex.org/W2611532517","https://openalex.org/W2913256821","https://openalex.org/W3151628504","https://openalex.org/W3152126650","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2373493542","https://openalex.org/W2157421865","https://openalex.org/W1972999554","https://openalex.org/W2136872995","https://openalex.org/W2004163233","https://openalex.org/W2110559866","https://openalex.org/W1537901463","https://openalex.org/W2094152042","https://openalex.org/W2274535290","https://openalex.org/W2062226917"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2018,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}