On the Approximability of Interactive Knapsack Problems

Authors:
Isto Aho
Affiliations:
-
Venue:
SOFSEM '01 Proceedings of the 28th Conference on Current Trends in Theory and Practice of Informatics Piestany: Theory and Practice of Informatics
Year:
2001

Citing 6
Cited 2

Knapsack problems: algorithms and computer implementations

Knapsack problems: algorithms and computer implementations
Improved approximations of packing and covering problems

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
On multi-dimensional packing problems

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
A PTAS for the multiple knapsack problem

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Interactive Knapsacks

Fundamenta Informaticae

New polynomial-time instances to various knapsack-type problems

Fundamenta Informaticae
New polynomial-time instances to various knapsack-type problems

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

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.