The equivalence of Knapsack and Waterfilling problems

Khan, Mohammed Zafar Ali (2018) The equivalence of Knapsack and Waterfilling problems. In: IEEE International Conference on the Science of Electrical Engineering in Israel (ICSEE), 12-14 December 2018, Israel.

Full text not available from this repository. (Request a copy)


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.

[error in script]
IITH Creators:
IITH CreatorsORCiD
Khan, Mohammed Zafar AliUNSPECIFIED
Item Type: Conference or Workshop Item (Paper)
Subjects: Electrical Engineering
Depositing User: Team Library
Date Deposited: 27 Feb 2019 11:58
Last Modified: 27 Feb 2019 11:58
Publisher URL:
Related URLs:

Actions (login required)

View Item View Item
Statistics for RAIITH ePrint 4844 Statistics for this ePrint Item