On different approximation criteria for subset product problems
- 1 October 1985
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 21 (4) , 213-218
- https://doi.org/10.1016/0020-0190(85)90061-4
Abstract
No abstract availableThis publication has 4 references indexed in Scilit:
- Non deterministic polynomial optimization problems and their approximationsTheoretical Computer Science, 1981
- Toward a unified approach for the classification of NP-complete optimization problemsTheoretical Computer Science, 1980
- Fast Approximation Algorithms for the Knapsack and Sum of Subset ProblemsJournal of the ACM, 1975
- Approximate Algorithms for the 0/1 Knapsack ProblemJournal of the ACM, 1975