Learning-augmented algorithms for online subset sum
From MaRDI portal
Cites work
- A fully polynomial approximation algorithm for the 0-1 knapsack problem
- A new fully polynomial time approximation scheme for the interval subset sum problem
- A new fully polynomial time approximation scheme for the Knapsack problem
- A PAC Approach to Application-Specific Algorithm Selection
- An efficient fully polynomial approximation scheme for the Subset-Sum problem.
- Competitive Caching with Machine Learned Advice
- Computing and Combinatorics
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 7758362 (Why is no real title available?)
- scientific article; zbMATH DE number 7740914 (Why is no real title available?)
- Linear Time Algorithms for Knapsack Problems with Bounded Weights
- Near-Optimal Bounds for Online Caching with Machine Learned Advice
- Online Algorithms for Weighted Paging with Predictions
- Online Metric Algorithms with Untrusted Predictions
- Online Scheduling via Learned Weights
- Randomized algorithms for online knapsack problems
- Secretary and online matching problems with machine learned advice
Cited in
(4)
This page was built for publication: Learning-augmented algorithms for online subset sum
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6064057)
