{"id":"https://openalex.org/W1482945941","doi":"https://doi.org/10.1007/978-3-642-12139-5_24","title":"Efficient Cycle Search for the Minimum Routing Cost Spanning Tree Problem","display_name":"Efficient Cycle Search for the Minimum Routing Cost Spanning Tree Problem","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W1482945941","doi":"https://doi.org/10.1007/978-3-642-12139-5_24","mag":"1482945941"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-12139-5_24","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-12139-5_24","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"conference-paper","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/A5060589080","display_name":"Steffen Wolf","orcid":"https://orcid.org/0000-0002-9639-2509"},"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":"Steffen Wolf","raw_affiliation_strings":["University of Kaiserslautern, P.O. Box 3049, 67653, Kaiserslautern, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Kaiserslautern, P.O. Box 3049, 67653, Kaiserslautern, Germany","institution_ids":["https://openalex.org/I153267046"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5105361347","display_name":"Peter Merz","orcid":null},"institutions":[{"id":"https://openalex.org/I140025399","display_name":"Hochschule Hannover","ror":"https://ror.org/03m2kj587","country_code":"DE","type":"education","lineage":["https://openalex.org/I140025399"]},{"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":"Peter Merz","raw_affiliation_strings":["University of Kaiserslautern, P.O. Box 3049, 67653, Kaiserslautern, Germany","University of Applied Sciences and Arts, Hannover, Ricklinger Stadtweg 120, 30459, Hannover, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Kaiserslautern, P.O. Box 3049, 67653, Kaiserslautern, Germany","institution_ids":["https://openalex.org/I153267046"]},{"raw_affiliation_string":"University of Applied Sciences and Arts, Hannover, Ricklinger Stadtweg 120, 30459, Hannover, Germany","institution_ids":["https://openalex.org/I140025399"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.2725,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.43438776,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"276","last_page":"287"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9923999905586243,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9923999905586243,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9866999983787537,"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/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9631999731063843,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/computer-science","display_name":"Computer science","score":0.7079429030418396},{"id":"https://openalex.org/keywords/guided-local-search","display_name":"Guided Local Search","score":0.5971195101737976},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.5736436247825623},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5332548022270203},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5144091248512268},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4897001087665558},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.46126845479011536},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.4574025273323059},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.4477691948413849},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.4282289743423462},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2059648334980011},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19071340560913086}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7079429030418396},{"id":"https://openalex.org/C90189156","wikidata":"https://www.wikidata.org/wiki/Q5615481","display_name":"Guided Local Search","level":3,"score":0.5971195101737976},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.5736436247825623},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5332548022270203},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5144091248512268},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4897001087665558},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.46126845479011536},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.4574025273323059},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.4477691948413849},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.4282289743423462},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2059648334980011},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19071340560913086},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-642-12139-5_24","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-12139-5_24","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W18216792","https://openalex.org/W647522939","https://openalex.org/W1544493157","https://openalex.org/W2011039300","https://openalex.org/W2016218947","https://openalex.org/W2024833164","https://openalex.org/W2047517090","https://openalex.org/W2125536653","https://openalex.org/W2135797138","https://openalex.org/W2142449826","https://openalex.org/W2148948822","https://openalex.org/W2400908863","https://openalex.org/W2491502393","https://openalex.org/W3138832177","https://openalex.org/W3204855000","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W1537780499","https://openalex.org/W1521720388","https://openalex.org/W1533229056","https://openalex.org/W1843628981","https://openalex.org/W1516893820","https://openalex.org/W2087594839","https://openalex.org/W2492630225","https://openalex.org/W2794473043","https://openalex.org/W2901129955","https://openalex.org/W2775536880"],"abstract_inverted_index":null,"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-08-04T08:18:43.703281","created_date":"2025-10-10T00:00:00"}