Randomized algorithms for online knapsack problems (Q476887): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W27 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W20 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C27 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6375991 / rank
 
Normal rank
Property / zbMATH Keywords
 
online algorithm
Property / zbMATH Keywords: online algorithm / rank
 
Normal rank
Property / zbMATH Keywords
 
competitive analysis
Property / zbMATH Keywords: competitive analysis / rank
 
Normal rank
Property / zbMATH Keywords
 
randomized algorithm
Property / zbMATH Keywords: randomized algorithm / rank
 
Normal rank
Property / zbMATH Keywords
 
knapsack problem
Property / zbMATH Keywords: knapsack problem / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2014.10.017 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1980280644 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Knapsack Secretary Problem with Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Knapsack Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921694 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Knapsack Problem with Removal Cost / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized Algorithms for Removable Online Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Minimization Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant-Time Approximation Algorithms for the Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737165 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Resource Augmentations for Online Knapsack / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average-Case Analysis of Off-Line and On-Line Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic on-line knapsack problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:53, 9 July 2024

scientific article
Language Label Description Also known as
English
Randomized algorithms for online knapsack problems
scientific article

    Statements

    Randomized algorithms for online knapsack problems (English)
    0 references
    0 references
    0 references
    0 references
    2 December 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    online algorithm
    0 references
    competitive analysis
    0 references
    randomized algorithm
    0 references
    knapsack problem
    0 references
    0 references