scientific article; zbMATH DE number 7561569
From MaRDI portal
Publication:5091235
DOI10.4230/LIPIcs.ICALP.2019.76MaRDI QIDQ5091235
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/1904.09562
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (7)
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 ⋮ Approximating single- and multi-objective nonlinear sum and product knapsack problems ⋮ Approximation schemes for multiperiod binary knapsack problems ⋮ An FPTAS for the \(\varDelta \)-modular multidimensional knapsack problem ⋮ Robust online algorithms for dynamic choosing problems
Cites Work
- Unnamed Item
- Unnamed Item
- Necklaces, convolutions, and \(X+Y\)
- Geometric applications of a matrix-searching algorithm
- A new fully polynomial time approximation scheme for the Knapsack problem
- An efficient fully polynomial approximation scheme for the Subset-Sum problem.
- A faster FPTAS for the unbounded knapsack problem
- Improved dynamic programming in connection with an FPTAS for the knapsack problem
- Fast Approximation Algorithms for Knapsack Problems
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- Deterministic APSP, Orthogonal Vectors, and More: Quickly Derandomizing Razborov-Smolensky
- On Problems Equivalent to (min,+)-Convolution
- Reducibility among Combinatorial Problems
- A Subquadratic Approximation Scheme for Partition
- Faster all-pairs shortest paths via circuit complexity
This page was built for publication:
