{"title":"Simple Methods for Traveling Salesman Problems","authors":"N. Vakhania","doi":"10.3390/ioca2021-10914","DOIUrl":null,"url":null,"abstract":"Here we will focus on an ongoing project on approximation algorithms for the Euclidean Traveling Salesman Problems (TSP) [...]","PeriodicalId":155422,"journal":{"name":"Computer Sciences & Mathematics Forum","volume":"66 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Sciences & Mathematics Forum","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3390/ioca2021-10914","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Here we will focus on an ongoing project on approximation algorithms for the Euclidean Traveling Salesman Problems (TSP) [...]
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
