Randomized algorithms for online knapsack problems
type: Item
instance of: scholarly article
title: Randomized algorithms for online knapsack problems
zbMATH Open document ID: 1303.68160
author: Xin Han
author: Yasushi Kawase
author: Kazuhisa Makino
published in: Theoretical Computer Science
publication date: 2014-12-02T00:00:00Z
Mathematics Subject Classification ID: 68W27
Mathematics Subject Classification ID: 68W20
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6375991
zbMATH Keywords: online algorithm
zbMATH Keywords: competitive analysis
zbMATH Keywords: randomized algorithm
zbMATH Keywords: knapsack problem
MaRDI profile type: Publication
full work available at URL: j.tcs.2014.10.017
OpenAlex ID: W1980280644
cites work: A Knapsack Secretary Problem with Applications
cites work: Algorithms – ESA 2005
cites work: Online Knapsack Revisited
cites work: Adaptivity and approximation for stochastic packing problems
cites work: Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity
cites work: Online Knapsack Problem with Removal Cost
cites work: Randomized Algorithms for Removable Online Knapsack Problems
cites work: Online Minimization Knapsack Problem
cites work: Constant-Time Approximation Algorithms for the Knapsack Problem
cites work: Q4737165
cites work: Optimal Resource Augmentations for Online Knapsack
cites work: Q4821303
cites work: Average-Case Analysis of Off-Line and On-Line Knapsack Problems
cites work: Stochastic on-line knapsack problems
DOI: 10.1016/J.TCS.2014.10.017
description: scientific article; zbMATH DE number 6375991