Learning-augmented algorithms for online subset sum
- 13 April 2022
- journal article
- research article
- Published by Springer Nature in Journal of Global Optimization
- Vol. 87 (2-4) , 989-1008
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- National Major Science and Technology Projects of China (2018AAA0100902)
This publication has 15 references indexed in Scilit:
- Gate-variants of Gated Recurrent Unit (GRU) neural networks2017
- A new fully polynomial time approximation scheme for the interval subset sum problemJournal of Global Optimization, 2017
- A PAC Approach to Application-Specific Algorithm SelectionSIAM Journal on Computing, 2017
- Randomized algorithms for online knapsack problemsTheoretical Computer Science, 2015
- Interval Subset Sum and Uniform-Price Auction Clearing2005
- An efficient fully polynomial approximation scheme for the Subset-Sum ProblemJournal of Computer and System Sciences, 2003
- Linear Time Algorithms for Knapsack Problems with Bounded WeightsJournal of Algorithms, 1999
- A fully polynomial approximation algorithm for the 0–1 knapsack problemEuropean Journal of Operational Research, 1981
- Probabilistic computations: Toward a unified measure of complexity1977
- Fast Approximation Algorithms for the Knapsack and Sum of Subset ProblemsJournal of the ACM, 1975