Learning-augmented algorithms for online subset sum (Q6064057): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10898-022-01156-w / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10898-022-01156-w / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4223525872 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Metric Algorithms with Untrusted Predictions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secretary and online matching problems with machine learned advice / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new fully polynomial time approximation scheme for the interval subset sum problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A PAC Approach to Application-Specific Algorithm Selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized algorithms for online knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Algorithms for Weighted Paging with Predictions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient fully polynomial approximation scheme for the Subset-Sum problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new fully polynomial time approximation scheme for the Knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing and Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Scheduling via Learned Weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q6075951 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive Caching with Machine Learned Advice / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fully polynomial approximation algorithm for the 0-1 knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Time Algorithms for Knapsack Problems with Bounded Weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-Optimal Bounds for Online Caching with Machine Learned Advice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q6058190 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10898-022-01156-W / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:06, 30 December 2024

scientific article; zbMATH DE number 7762786
Language Label Description Also known as
English
Learning-augmented algorithms for online subset sum
scientific article; zbMATH DE number 7762786

    Statements

    Learning-augmented algorithms for online subset sum (English)
    0 references
    0 references
    0 references
    8 November 2023
    0 references
    competitive analysis
    0 references
    subset sum
    0 references
    learning-augmented algorithms
    0 references
    untrusted predictions
    0 references

    Identifiers