Optimal on-line algorithms for variable-sized bin covering
type: Item
instance of: scholarly article
title: Optimal on-line algorithms for variable-sized bin covering
zbMATH Open document ID: 0941.90073
DOI: 10.1016/S0167-6377(99)00023-1
author: Gerhard J. Woeginger
author: Guochuan Zhang
published in: Operations Research Letters
publication date: 1999-12-19T00:00:00Z
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 1347053
zbMATH Keywords: on-line algorithm
zbMATH Keywords: competitive analysis
zbMATH Keywords: approximation algorithm
zbMATH Keywords: asymptotic worst-case ratio
zbMATH Keywords: covering problem
MaRDI profile type: Publication
cites work: On-line and off-line approximation algorithms for vector covering problems
cites work: On a dual version of the one-dimensional bin packing problem
cites work: Probabilistic analysis of algorithms for dual bin packing problems
cites work: Online algorithms for a dual version of bin packing
cites work: Q4198056
cites work: A simple on-line bin-packing algorithm
Wikidata QID: Q127725617
description: scientific article; zbMATH DE number 1347053