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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
