Average sensitivity of the knapsack problem
From MaRDI portal
Cites work
- A Knapsack Secretary Problem with Applications
- A new fully polynomial time approximation scheme for the Knapsack problem
- An On-Line Edge-Deletion Problem
- Average sensitivity of dynamic programming
- Discrete-variable extremum problems
- Dynamic approximate shortest paths and beyond: subquadratic and worst-case update time
- Fast Approximation Algorithms for Knapsack Problems
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- Fully dynamic (1+ e)-approximate matchings
- Fully-dynamic bin packing with little repacking
- Fully-dynamic submodular cover with bounded recourse
- scientific article; zbMATH DE number 2086630 (Why is no real title available?)
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- scientific article; zbMATH DE number 7561569 (Why is no real title available?)
- scientific article; zbMATH DE number 7122316 (Why is no real title available?)
- scientific article; zbMATH DE number 7650261 (Why is no real title available?)
- scientific article; zbMATH DE number 7788381 (Why is no real title available?)
- scientific article; zbMATH DE number 7799596 (Why is no real title available?)
- Improved dynamic programming in connection with an FPTAS for the knapsack problem
- Maintaining a large matching and a small vertex cover
- Online and dynamic algorithms for set cover
- Online primal-dual algorithms for covering and packing
- Reducibility among combinatorial problems
- Stochastic on-line knapsack problems
- Theory of Cryptography
Cited in
(2)
This page was built for publication: Average sensitivity of the knapsack problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6969603)
