Online minimization knapsack problem
type: Item
instance of: scholarly article
title: Online minimization knapsack problem
zbMATH Open document ID: 1331.68299
author: Xin Han
author: Kazuhisa Makino
published in: Theoretical Computer Science
publication date: 2015-12-08T00:00:00Z
Mathematics Subject Classification ID: 68W27
Mathematics Subject Classification ID: 68W20
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6517437
zbMATH Keywords: knapsack
zbMATH Keywords: competitive analysis
zbMATH Keywords: online algorithms
MaRDI profile type: Publication
full work available at URL: j.tcs.2015.09.021
OpenAlex ID: W2174718091
cites work: Q4090116
cites work: Q3988807
cites work: Incremental medians via online bidding
cites work: Online knapsack revisited
cites work: Approximate minimization algorithms for the 0/1 knapsack and subset-sum problem
cites work: Q3898034
cites work: Online Minimization Knapsack Problem
cites work: Online removable knapsack with limited cuts
cites work: Online unweighted knapsack problem with removal cost
cites work: Randomized algorithms for online knapsack problems
cites work: Finite-State Online Algorithms and Their Automated Competitive Analysis
cites work: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
cites work: Q4737165
cites work: Online knapsack with resource augmentation
cites work: Q4821303
cites work: Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem
cites work: Q4886047
cites work: Stochastic on-line knapsack problems
DOI: 10.1016/J.TCS.2015.09.021
description: scientific article; zbMATH DE number 6517437