{"title":"一些集和序列划分np困难问题的有效逼近算法","authors":"A. Kel’manov","doi":"10.1109/SIBIRCON.2017.8109843","DOIUrl":null,"url":null,"abstract":"We consider some poorly studied NP-hard partitioning problems. The paper purpose is to present a short survey on some new results on efficient algorithms with performance guarantees for their solutions.","PeriodicalId":135870,"journal":{"name":"2017 International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Efficient approximation algorithms for some NP-hard problems of partitioning a set and a sequence\",\"authors\":\"A. Kel’manov\",\"doi\":\"10.1109/SIBIRCON.2017.8109843\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider some poorly studied NP-hard partitioning problems. The paper purpose is to present a short survey on some new results on efficient algorithms with performance guarantees for their solutions.\",\"PeriodicalId\":135870,\"journal\":{\"name\":\"2017 International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SIBIRCON.2017.8109843\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SIBIRCON.2017.8109843","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Efficient approximation algorithms for some NP-hard problems of partitioning a set and a sequence
We consider some poorly studied NP-hard partitioning problems. The paper purpose is to present a short survey on some new results on efficient algorithms with performance guarantees for their solutions.