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.

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

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.