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)

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.

[error in script]

IITH Creators:	IITH Creators ORCiD Khan, Mohammed Zafar Ali UNSPECIFIED
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
URI:	http://raiithold.iith.ac.in/id/eprint/4844
Publisher URL:	http://doi.org/10.1109/ICSEE.2018.8646214
Related URLs:	Google Scholar

Actions (login required)

View Item

Statistics for this ePrint Item