{"id":"https://openalex.org/W1976117692","doi":"https://doi.org/10.1002/net.3230210605","title":"Balanced spanning forests and trees","display_name":"Balanced spanning forests and trees","publication_year":1991,"publication_date":"1991-10-01","ids":{"openalex":"https://openalex.org/W1976117692","doi":"https://doi.org/10.1002/net.3230210605","mag":"1976117692"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230210605","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230210605","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","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/A5003959949","display_name":"Agha Iqbal Ali","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Agha Iqbal Ali","raw_affiliation_strings":["School of Management, The University of Massachusetts at Amherst, Amherst, Massachusetts 01003"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Management, The University of Massachusetts at Amherst, Amherst, Massachusetts 01003","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016343111","display_name":"Chung\u2010Hsing Huang","orcid":null},"institutions":[{"id":"https://openalex.org/I16733864","display_name":"National Taiwan University","ror":"https://ror.org/05bqach95","country_code":"TW","type":"education","lineage":["https://openalex.org/I16733864"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Chung\u2010Hsing Huang","raw_affiliation_strings":["National Taiwan University","National Taiwan University > > > >  >  >"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"National Taiwan University","institution_ids":["https://openalex.org/I16733864"]},{"raw_affiliation_string":"National Taiwan University > > > >  >  >","institution_ids":["https://openalex.org/I16733864"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.15938971,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"21","issue":"6","first_page":"667","last_page":"687"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.995199978351593,"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.9839000105857849,"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/heuristics","display_name":"Heuristics","score":0.7902266383171082},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.6302427649497986},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.6222163438796997},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.583422839641571},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5630732178688049},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.5361219644546509},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5345093011856079},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.49521604180336},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.46428170800209045},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.43985825777053833},{"id":"https://openalex.org/keywords/component","display_name":"Component (thermodynamics)","score":0.4155324101448059},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3594076335430145},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.15351325273513794}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7902266383171082},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.6302427649497986},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.6222163438796997},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.583422839641571},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5630732178688049},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.5361219644546509},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5345093011856079},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.49521604180336},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.46428170800209045},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.43985825777053833},{"id":"https://openalex.org/C168167062","wikidata":"https://www.wikidata.org/wiki/Q1117970","display_name":"Component (thermodynamics)","level":2,"score":0.4155324101448059},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3594076335430145},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.15351325273513794},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","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},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C97355855","wikidata":"https://www.wikidata.org/wiki/Q11473","display_name":"Thermodynamics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.3230210605","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230210605","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Life in Land","id":"https://metadata.un.org/sdg/15","score":0.7200000286102295}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1550550959","https://openalex.org/W1963574949","https://openalex.org/W1965680834","https://openalex.org/W1967957610","https://openalex.org/W1973942323","https://openalex.org/W2008200956","https://openalex.org/W2009803313","https://openalex.org/W2012682597","https://openalex.org/W2017127755","https://openalex.org/W2025325419","https://openalex.org/W2036940456","https://openalex.org/W2079828065","https://openalex.org/W2104431850","https://openalex.org/W2108753073","https://openalex.org/W2147892615","https://openalex.org/W2152413298","https://openalex.org/W2155735286","https://openalex.org/W2158407149","https://openalex.org/W2164581054","https://openalex.org/W3201153891"],"related_works":["https://openalex.org/W2418231958","https://openalex.org/W2099915933","https://openalex.org/W3116169590","https://openalex.org/W1703428550","https://openalex.org/W4380840098","https://openalex.org/W2044443696","https://openalex.org/W2503538928","https://openalex.org/W3101281637","https://openalex.org/W2390742649","https://openalex.org/W1561849181"],"abstract_inverted_index":{"Abstract":[0],"This":[1],"work":[2],"addresses":[3],"spanning":[4],"forests":[5],"and":[6,28,41,72],"trees":[7],"in":[8,14,32,59],"which":[9],"the":[10,65],"number":[11],"of":[12,25],"nodes":[13],"component":[15],"subtrees":[16],"is":[17],"balanced.":[18],"The":[19],"solution":[20],"procedure":[21],"developed":[22],"makes":[23],"use":[24],"Lagrangean":[26],"relaxation":[27],"heuristics.":[29],"Dual\u2010ascent":[30],"procedures":[31],"conjunction":[33],"with":[34,52],"heuristics":[35],"are":[36],"used":[37],"to":[38,61,74],"yield":[39],"lower":[40],"upper":[42],"bounds.":[43],"Computational":[44],"experience":[45],"indicates":[46],"that":[47],"optimal":[48],"or":[49],"suboptimal":[50],"solutions":[51],"very":[53],"tight":[54],"bounds":[55],"can":[56],"be":[57],"obtained":[58],"180":[60],"300":[62],"iterations":[63,76],"on":[64],"average":[66],"for":[67,77],"100\u2010node":[68,78],"balanced":[69,79],"tree":[70],"problems":[71],"700":[73],"1400":[75],"forest":[80],"problems.":[81]},"counts_by_year":[{"year":2021,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}