scientific article; zbMATH DE number 7561569
From MaRDI portal
Publication:5091235
Recommendations
- Publication:3481489
- Improved dynamic programming in connection with an FPTAS for the knapsack problem
- Implementing an efficient fptas for the 0-1 multi-objective knapsack problem
- A faster FPTAS for \#Knapsack
- A Practical Efficient Fptas for the 0-1 Multi-objective Knapsack Problem
- Improved results on the 0--1 multidimensional knapsack problem
- An Improved Heuristic for Multidimensional 0-1 Knapsack Problems
- An improved parallel algorithm for 0/1 knapsack problem
- An FPTAS for the parametric knapsack problem
- A New Algorithm for the 0-1 Knapsack Problem
Cites work
- A new fully polynomial time approximation scheme for the Knapsack problem
- A subquadratic approximation scheme for partition
- An efficient fully polynomial approximation scheme for the Subset-Sum problem.
- Deterministic APSP, orthogonal vectors, and more: quickly derandomizing Razborov-Smolensky
- Fast Approximation Algorithms for Knapsack Problems
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- Faster all-pairs shortest paths via circuit complexity
- Geometric applications of a matrix-searching algorithm
- scientific article; zbMATH DE number 7204473 (Why is no real title available?)
- scientific article; zbMATH DE number 7122316 (Why is no real title available?)
- Improved dynamic programming in connection with an FPTAS for the knapsack problem
- Necklaces, convolutions, and \(X+Y\)
- On problems equivalent to \((\min,+)\)-convolution
- Reducibility among combinatorial problems
Cited in
(13)- Approximation schemes for multiperiod binary knapsack problems
- An FPTAS for the -modular multidimensional knapsack problem
- Robust online algorithms for dynamic choosing problems
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems
- Approximation schemes for subset-sums ratio problems
- The sum of root-leaf distance interdiction problem by upgrading edges/nodes on trees
- scientific article; zbMATH DE number 5733022 (Why is no real title available?)
- Approximating single- and multi-objective nonlinear sum and product knapsack problems
- No polynomial kernels for knapsack
- Average sensitivity of the knapsack problem
- Online unbounded knapsack
- On the two-dimensional knapsack problem for convex polygons
- Weakly approximating knapsack in subquadratic time
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5091235)
