{"title":"最小权值k-子图覆盖问题的改进逼近算法","authors":"Pengcheng Liu, Xiaohui Huang, Zhao Zhang","doi":"10.1007/978-3-030-36412-0_28","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":149649,"journal":{"name":"International Conference on Combinatorial Optimization and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Improved Approximation Algorithm for Minimum Weight k-Subgraph Cover Problem\",\"authors\":\"Pengcheng Liu, Xiaohui Huang, Zhao Zhang\",\"doi\":\"10.1007/978-3-030-36412-0_28\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":149649,\"journal\":{\"name\":\"International Conference on Combinatorial Optimization and Applications\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-12-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Conference on Combinatorial Optimization and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/978-3-030-36412-0_28\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Combinatorial Optimization and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-3-030-36412-0_28","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0