{"id":"https://openalex.org/W2008581797","doi":"https://doi.org/10.1007/bf02032304","title":"On spanning tree problems with multiple objectives","display_name":"On spanning tree problems with multiple objectives","publication_year":1994,"publication_date":"1994-12-01","ids":{"openalex":"https://openalex.org/W2008581797","doi":"https://doi.org/10.1007/bf02032304","mag":"2008581797"},"language":"en","primary_location":{"id":"doi:10.1007/bf02032304","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf02032304","pdf_url":null,"source":{"id":"https://openalex.org/S57667410","display_name":"Annals of Operations Research","issn_l":"0254-5330","issn":["0254-5330","1572-9338"],"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":"Annals of Operations Research","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/4857","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5111683448","display_name":"Horst W. Hamacher","orcid":null},"institutions":[{"id":"https://openalex.org/I153267046","display_name":"University of Kaiserslautern","ror":"https://ror.org/04zrf7b53","country_code":"DE","type":"education","lineage":["https://openalex.org/I153267046"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Horst W. Hamacher","raw_affiliation_strings":["Fachbereich Mathematik, and Zentrum f\u00fcr Techno-und Wirtschaftsmathematik, Universit\u00e4t Kaiserslautern, Kaiserslautern, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Fachbereich Mathematik, and Zentrum f\u00fcr Techno-und Wirtschaftsmathematik, Universit\u00e4t Kaiserslautern, Kaiserslautern, Germany","institution_ids":["https://openalex.org/I153267046"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113566320","display_name":"G\u00fcnter Ruhe","orcid":null},"institutions":[{"id":"https://openalex.org/I153267046","display_name":"University of Kaiserslautern","ror":"https://ror.org/04zrf7b53","country_code":"DE","type":"education","lineage":["https://openalex.org/I153267046"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"G\u00fcnter Ruhe","raw_affiliation_strings":["Fachbereich Mathematik, and Zentrum f\u00fcr Techno-und Wirtschaftsmathematik, Universit\u00e4t Kaiserslautern, Kaiserslautern, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Fachbereich Mathematik, and Zentrum f\u00fcr Techno-und Wirtschaftsmathematik, Universit\u00e4t Kaiserslautern, Kaiserslautern, Germany","institution_ids":["https://openalex.org/I153267046"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I153267046"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":7.697,"has_fulltext":false,"cited_by_count":139,"citation_normalized_percentile":{"value":0.96778751,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"52","issue":"4","first_page":"209","last_page":"230"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.994700014591217,"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/T12176","display_name":"Optimization and Packing Problems","score":0.994700014591217,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9896000027656555,"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/T12709","display_name":"Optimization and Mathematical Programming","score":0.9764999747276306,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/spanning-tree","display_name":"Spanning tree","score":0.8598394989967346},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.764135479927063},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.6810725331306458},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6686522960662842},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.63034588098526},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.6236799955368042},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.5565528273582458},{"id":"https://openalex.org/keywords/shortest-path-tree","display_name":"Shortest-path tree","score":0.5042935609817505},{"id":"https://openalex.org/keywords/distributed-minimum-spanning-tree","display_name":"Distributed minimum spanning tree","score":0.5019314289093018},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.49870753288269043},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.43988385796546936},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.39822909235954285},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.30168360471725464},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.2639234960079193},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.2442360818386078},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.10534867644309998}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.8598394989967346},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.764135479927063},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.6810725331306458},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6686522960662842},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.63034588098526},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.6236799955368042},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.5565528273582458},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.5042935609817505},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.5019314289093018},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.49870753288269043},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.43988385796546936},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.39822909235954285},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30168360471725464},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.2639234960079193},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.2442360818386078},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.10534867644309998}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/bf02032304","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf02032304","pdf_url":null,"source":{"id":"https://openalex.org/S57667410","display_name":"Annals of Operations Research","issn_l":"0254-5330","issn":["0254-5330","1572-9338"],"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":"Annals of Operations Research","raw_type":"journal-article"},{"id":"pmh:oai:aleph.bib-bvb.de:BVB01-005976400","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:kluedo.ub.uni-kl.de:4857","is_oa":true,"landing_page_url":"https://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/4857","pdf_url":null,"source":{"id":"https://openalex.org/S4306402046","display_name":"Publication Server of Kaiserslautern University of Technology (Kaiserslautern University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I153267046","host_organization_name":"University of Kaiserslautern","host_organization_lineage":["https://openalex.org/I153267046"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"report"}],"best_oa_location":{"id":"pmh:oai:kluedo.ub.uni-kl.de:4857","is_oa":true,"landing_page_url":"https://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/4857","pdf_url":null,"source":{"id":"https://openalex.org/S4306402046","display_name":"Publication Server of Kaiserslautern University of Technology (Kaiserslautern University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I153267046","host_organization_name":"University of Kaiserslautern","host_organization_lineage":["https://openalex.org/I153267046"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"report"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.6299999952316284,"display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1965680834","https://openalex.org/W1976720680","https://openalex.org/W1977545325","https://openalex.org/W1984722976","https://openalex.org/W2009803313","https://openalex.org/W2009938762","https://openalex.org/W2017927472","https://openalex.org/W2055114648","https://openalex.org/W2091360576","https://openalex.org/W2091507391","https://openalex.org/W2098120964","https://openalex.org/W2115049345","https://openalex.org/W2153015072","https://openalex.org/W2767741732"],"related_works":["https://openalex.org/W4380840098","https://openalex.org/W2943635264","https://openalex.org/W3016811403","https://openalex.org/W2387385213","https://openalex.org/W2390742649","https://openalex.org/W2138987445","https://openalex.org/W2589768050","https://openalex.org/W88291963","https://openalex.org/W620960161","https://openalex.org/W2014991506"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":3},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":5}],"updated_date":"2026-06-19T15:47:20.252518","created_date":"2025-10-10T00:00:00"}