Polynomially Correlated Knapsack is NP-complete
Computational Complexity
2009-10-15 v1
Abstract
0-1 Knapsack is a fundamental NP-complete problem. In this article we prove that it remains NP-complete even when the weights of the objects in the packing constraints and their values in the objective function satisfy specific stringent conditions: the values are integral powers of the weights of the objects.
Cite
@article{arxiv.0910.2649,
title = {Polynomially Correlated Knapsack is NP-complete},
author = {Chinmay Karande},
journal= {arXiv preprint arXiv:0910.2649},
year = {2009}
}