{"title":"背包与充水问题的等价性","authors":"Mohammed Zafar Ali Khan","doi":"10.1109/ICSEE.2018.8646214","DOIUrl":null,"url":null,"abstract":"In many communications and signal processing optimization problems, the water-filling problem plays an important role in resource optimization. In this paper we show that the water-filling problem is equivalent to the classical Knapsack Problem, which is known to be NP-hard. Consequently, using the linear complexity solutions for water-filling problems and the equivalence of Knapsack Problem with water-filling problem, we present new linear time approximate solutions for Knapsack problem.","PeriodicalId":254455,"journal":{"name":"2018 IEEE International Conference on the Science of Electrical Engineering in Israel (ICSEE)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The equivalence of Knapsack and Waterfilling problems\",\"authors\":\"Mohammed Zafar Ali Khan\",\"doi\":\"10.1109/ICSEE.2018.8646214\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In many communications and signal processing optimization problems, the water-filling problem plays an important role in resource optimization. In this paper we show that the water-filling problem is equivalent to the classical Knapsack Problem, which is known to be NP-hard. Consequently, using the linear complexity solutions for water-filling problems and the equivalence of Knapsack Problem with water-filling problem, we present new linear time approximate solutions for Knapsack problem.\",\"PeriodicalId\":254455,\"journal\":{\"name\":\"2018 IEEE International Conference on the Science of Electrical Engineering in Israel (ICSEE)\",\"volume\":\"37 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE International Conference on the Science of Electrical Engineering in Israel (ICSEE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICSEE.2018.8646214\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE International Conference on the Science of Electrical Engineering in Israel (ICSEE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSEE.2018.8646214","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The equivalence of Knapsack and Waterfilling problems
In many communications and signal processing optimization problems, the water-filling problem plays an important role in resource optimization. In this paper we show that the water-filling problem is equivalent to the classical Knapsack Problem, which is known to be NP-hard. Consequently, using the linear complexity solutions for water-filling problems and the equivalence of Knapsack Problem with water-filling problem, we present new linear time approximate solutions for Knapsack problem.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
