Skip to main content
Conference Proceedings

On the approximability of interactive knapsack problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2001) 2234 152-159
DOI: 10.1007/3-540-45627-9_12
1Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We show that the interactive knapsack heuristic optimization problem is APX-hard. Moreover, we discuss the relationship between the interactive knapsack heuristic optimization problem and some other knapsack problems.

Cite

CITATION STYLE

APA

Aho, I. (2001). On the approximability of interactive knapsack problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2234, pp. 152–159). Springer Verlag. https://doi.org/10.1007/3-540-45627-9_12

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free