{"id":"https://openalex.org/W2125536653","doi":"https://doi.org/10.1109/icit.2008.16","title":"A New Heuristic for the Minimum Routing Cost Spanning Tree Problem","display_name":"A New Heuristic for the Minimum Routing Cost Spanning Tree Problem","publication_year":2008,"publication_date":"2008-12-01","ids":{"openalex":"https://openalex.org/W2125536653","doi":"https://doi.org/10.1109/icit.2008.16","mag":"2125536653"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/icit.2008.16","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"proceedings-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/A5045783983","display_name":"Alok Singh","orcid":"https://orcid.org/0000-0003-3585-4957"},"institutions":[{"id":"https://openalex.org/I36893310","display_name":"University of Hyderabad","ror":"https://ror.org/04a7rxb17","country_code":"IN","type":"education","lineage":["https://openalex.org/I36893310"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Alok Singh","raw_affiliation_strings":["Sch. of Math. & Comput./Inf. Sci., Univ. of Hyderabad, Hyderabad, India"],"affiliations":[{"raw_affiliation_string":"Sch. of Math. & Comput./Inf. Sci., Univ. of Hyderabad, Hyderabad, India","institution_ids":["https://openalex.org/I36893310"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5045783983"],"corresponding_institution_ids":["https://openalex.org/I36893310"],"apc_list":null,"apc_paid":null,"fwci":1.919,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":11,"citation_normalized_percentile":{"value":0.898405,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":84,"max":85},"biblio":{"volume":"8","issue":null,"first_page":"9","last_page":"13"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Problem and Variants","score":0.9991,"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 Problem and Variants","score":0.9991,"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":"Trajectory Data Mining and Analysis","score":0.9894,"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/T12176","display_name":"Optimization of Cutting and Packing Problems","score":0.9865,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle Routing Problem","score":0.594508},{"id":"https://openalex.org/keywords/reverse-delete-algorithm","display_name":"Reverse-delete algorithm","score":0.57774967},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.53844476},{"id":"https://openalex.org/keywords/trajectory-data-mining","display_name":"Trajectory Data Mining","score":0.523352},{"id":"https://openalex.org/keywords/prims-algorithm","display_name":"Prim's algorithm","score":0.50727195},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.4759959}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.80824804},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.7835592},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.7676749},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.6620204},{"id":"https://openalex.org/C145685049","wikidata":"https://www.wikidata.org/wiki/Q4454941","display_name":"Euclidean minimum spanning tree","level":4,"score":0.6475484},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.5781014},{"id":"https://openalex.org/C199346575","wikidata":"https://www.wikidata.org/wiki/Q4925151","display_name":"Reverse-delete algorithm","level":4,"score":0.57774967},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5718469},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.5562367},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.53844476},{"id":"https://openalex.org/C1649724","wikidata":"https://www.wikidata.org/wiki/Q470813","display_name":"Prim's algorithm","level":4,"score":0.50727195},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.49922442},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.4759959},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.43504813},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.38599786},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32926047},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.25448945},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.17997375},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.16408396},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.1194278}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/icit.2008.16","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":13,"referenced_works":["https://openalex.org/W13055504","https://openalex.org/W1973297532","https://openalex.org/W2016218947","https://openalex.org/W2017927472","https://openalex.org/W2047517090","https://openalex.org/W2054148890","https://openalex.org/W2142146559","https://openalex.org/W2158280690","https://openalex.org/W2753176400","https://openalex.org/W3138832177","https://openalex.org/W4249958171","https://openalex.org/W4302604684","https://openalex.org/W647522939"],"related_works":["https://openalex.org/W4380840098","https://openalex.org/W3081212354","https://openalex.org/W3016811403","https://openalex.org/W2943635264","https://openalex.org/W2418231958","https://openalex.org/W2390742649","https://openalex.org/W2387385213","https://openalex.org/W2059360098","https://openalex.org/W1898478360","https://openalex.org/W1587959445"],"abstract_inverted_index":{"Given":[0],"a":[1,18,45,54,79],"connected,":[2],"weighted,":[3],"and":[4,78],"undirected":[5],"graph,":[6],"the":[7,31,34,38,72,85],"minimum":[8,22],"routing":[9,23,26],"cost":[10,27],"spanning":[11,19,46],"tree":[12,20],"problem":[13],"seeks":[14],"on":[15],"this":[16,49,60],"graph":[17],"of":[21,33,36,87],"cost,":[24],"where":[25],"is":[28],"defined":[29],"as":[30],"sum":[32],"costs":[35],"all":[37],"paths":[39],"connecting":[40],"two":[41,75],"distinct":[42],"vertices":[43],"in":[44,71],"tree.":[47],"In":[48],"paper":[50],"we":[51],"have":[52,63],"proposed":[53],"perturbation":[55],"based":[56],"local":[57],"search":[58],"for":[59],"problem.":[61],"We":[62],"compared":[64],"our":[65,88],"approach":[66],"against":[67],"three":[68],"methods":[69],"reported":[70],"literature":[73],"-":[74],"genetic":[76],"algorithms":[77],"stochastic":[80],"hill":[81],"climber.Computational":[82],"results":[83],"show":[84],"effectiveness":[86],"approach.":[89]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2125536653","counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2024-10-06T14:31:41.536902","created_date":"2016-06-24"}
