最大旅行商问题的4/5逼近算法

{"title":"最大旅行商问题的4/5逼近算法","authors":"S. Dudycz, Jan Marcinkowski, Katarzyna E. Paluch, Bartosz Rybicki","doi":"10.1007/978-3-319-59250-3_15","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":421894,"journal":{"name":"Conference on Integer Programming and Combinatorial Optimization","volume":"38 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":"{\"title\":\"A 4/5 - Approximation Algorithm for the Maximum Traveling Salesman Problem\",\"authors\":\"S. Dudycz, Jan Marcinkowski, Katarzyna E. Paluch, Bartosz Rybicki\",\"doi\":\"10.1007/978-3-319-59250-3_15\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":421894,\"journal\":{\"name\":\"Conference on Integer Programming and Combinatorial Optimization\",\"volume\":\"38 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-12-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"14\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Conference on Integer Programming and Combinatorial Optimization\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/978-3-319-59250-3_15\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Conference on Integer Programming and Combinatorial Optimization","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-3-319-59250-3_15","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}