The fully polynomial approximation algorithm for the 0-1 knapsack problem
From MaRDI portal
Publication:699820
DOI10.1007/S00224-002-1076-0zbMATH Open1052.68150OpenAlexW1976040835MaRDI QIDQ699820
Publication date: 25 September 2002
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-002-1076-0
Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Approximation algorithms (68W25)
Related Items (5)
A Deterministic Polynomial-Time Approximation Scheme for Counting Knapsack Solutions ⋮ Title not available (Why is that?) ⋮ Title not available (Why is that?) ⋮ Pseudo-polynomial algorithms for solving the knapsack problem with dependencies between items ⋮ Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses
This page was built for publication: The fully polynomial approximation algorithm for the 0-1 knapsack problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q699820)
