Online algorithms with advice for the dual bin packing problem
type: Item
instance of: scholarly article
title: Online algorithms with advice for the dual bin packing problem
zbMATH Open document ID: 1390.90480
author: Marc P. Renault
published in: CEJOR. Central European Journal of Operations Research
publication date: 2018-06-15T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 68W27
zbMATH DE Number: 6890237
zbMATH Keywords: online algorithms
zbMATH Keywords: online computation with advice
zbMATH Keywords: competitive analysis
zbMATH Keywords: dual bin packing
zbMATH Keywords: multiple knapsack problem
MaRDI profile type: Publication
full work available at URL: s10100-016-0450-y
OpenAlex ID: W2481908560
cites work: Reordering Buffer Management with Advice
cites work: Online makespan minimization with parallel schedules
cites work: Online Bin Packing with Advice of Small Size
cites work: Fair versus unrestricted bin packing
cites work: The online knapsack problem: advice and randomization
cites work: Semi on-line algorithms for the partition problem
cites work: Q4223058
cites work: Online bin packing with advice
cites work: The accommodating function: A generalization of the competitive ratio
cites work: Bin packing: Maximizing the number of pieces packed
cites work: Online knapsack revisited
cites work: On the Advice Complexity of Buffer Management
cites work: Online computation with advice
cites work: Q4439453
cites work: Online Stochastic Matching: Beating 1-1/e
cites work: Q4198056
cites work: Q4886075
cites work: Q4941826
cites work: Q4821303
cites work: Online bipartite matching with random arrivals
cites work: On online algorithms with advice for the \(k\)-server problem
cites work: Online algorithms with advice for bin packing and scheduling problems
DOI: 10.1007/S10100-016-0450-Y
Recommended article: Online algorithms for a dual version of bin packing
Recommended article: Online algorithms with advice for bin packing and scheduling problems
Recommended article: A Simple PTAS for the Dual Bin Packing Problem and Advice Complexity of Its Online Version
Recommended article: Q4535798
Recommended article: On the online bin packing problem
Recommended article: Parallel online algorithms for the Bin Packing Problem
Recommended article: Parallel online algorithms for the bin packing problem
Recommended article: Online Bin Packing: Old Algorithms and New Results
Recommended article: Q5009562
Recommended article: Online Algorithm for 1-Space Bounded Multi-dimensional Bin Packing
description: scientific article; zbMATH DE number 6890237