节点索引≤2的最小生成树等价于最小旅行推销员游

{"title":"节点索引≤2的最小生成树等价于最小旅行推销员游","authors":"Santosh Kumar, E. Munapo, C. Sigauke, Masar Al-Rabeeah","doi":"10.1201/b22521-8","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":93797,"journal":{"name":"Mathematics in applied sciences and engineering","volume":"31 1","pages":""},"PeriodicalIF":0.4000,"publicationDate":"2019-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The Minimum Spanning Tree with Node Index ≤ 2 Is Equivalent to the Minimum Traveling Salesman Tour\",\"authors\":\"Santosh Kumar, E. Munapo, C. Sigauke, Masar Al-Rabeeah\",\"doi\":\"10.1201/b22521-8\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":93797,\"journal\":{\"name\":\"Mathematics in applied sciences and engineering\",\"volume\":\"31 1\",\"pages\":\"\"},\"PeriodicalIF\":0.4000,\"publicationDate\":\"2019-09-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Mathematics in applied sciences and engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1201/b22521-8\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Mathematics in applied sciences and engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1201/b22521-8","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}