Learning-augmented algorithms for online subset sum

DOI10.1007/s10898-022-01156-wOpenAlexW4223525872MaRDI QIDQ6064057

Chenyang Xu, Guo-Chuan Zhang

Publication date: 8 November 2023

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-022-01156-w

zbMATH Keywords

competitive analysissubset sumlearning-augmented algorithmsuntrusted predictions

Mathematics Subject Classification ID

General topics in the theory of algorithms (68W01)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Randomized algorithms for online knapsack problems
• A fully polynomial approximation algorithm for the 0-1 knapsack problem
• A new fully polynomial time approximation scheme for the Knapsack problem
• An efficient fully polynomial approximation scheme for the Subset-Sum problem.
• A new fully polynomial time approximation scheme for the interval subset sum problem
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• Linear Time Algorithms for Knapsack Problems with Bounded Weights
• Competitive Caching with Machine Learned Advice
• Near-Optimal Bounds for Online Caching with Machine Learned Advice
• Online Scheduling via Learned Weights
• A PAC Approach to Application-Specific Algorithm Selection
• Computing and Combinatorics
• Online Algorithms for Weighted Paging with Predictions
• Online Metric Algorithms with Untrusted Predictions
• Secretary and online matching problems with machine learned advice

This page was built for publication: Learning-augmented algorithms for online subset sum