Publication:3883902
From MaRDI portal
zbMath0441.90069MaRDI QIDQ3883902
Bernhard Korte, Rainer Schrader
Publication date: 1980
approximate solutionscombinatorial optimizationknapsack problempolynomially bounded algorithmspolynomial approximation schemes
Related Items
Approximation schemes for parallel machine scheduling with availability constraints, Efficient Algorithms for Fixed-Precision Instances of Bin Packing and Euclidean TSP, Approximation scheduling algorithms: a survey