Combining Arithmetic and Geometric Rounding Techniques for Knapsack Problems

Authors:
Monaldo Mastrolilli
Affiliations:
-
Venue:
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Year:
2001

Citing 5
Cited 0

Approximation algorithms for NP-hard problems

Approximation algorithms for NP-hard problems
Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems

Journal of the ACM (JACM)
A New Fully Polynomial Approximation Scheme for the Knapsack Problem

APPROX '98 Proceedings of the International Workshop on Approximation Algorithms for Combinatorial Optimization
Fast approximation algorithms for knapsack problems

SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Time bounds for selection

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

We address the classical knapsack problem and a variant in which an upper bound is imposed on the number of items that can be selected. We show that appropriate combinations of rounding techniques yield novel and powerful ways of rounding. As an application of these techniques, we present a faster polynomial time approximation scheme requiring only linear storage, that computes an approximate solution of any fixed accuracy in linear time. This linear complexity bound gives a substantial improvement of the best previously known polynomial bound [2].