Optimal on-line algorithms for variable-sized bin covering (Q1306350): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Created claim: Wikidata QID (P12): Q127725617, #quickstatements; #temporary_batch_1722261696779 |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: Guo-Chuan Zhang / rank | |||
Property / author | |||
Property / author: Guo-Chuan Zhang / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On-line and off-line approximation algorithms for vector covering problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On a dual version of the one-dimensional bin packing problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Probabilistic analysis of algorithms for dual bin packing problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Online algorithms for a dual version of bin packing / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A simple on-line bin-packing algorithm / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q127725617 / rank | |||
Normal rank |
Latest revision as of 16:04, 29 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Optimal on-line algorithms for variable-sized bin covering |
scientific article |
Statements
Optimal on-line algorithms for variable-sized bin covering (English)
0 references
19 December 1999
0 references
on-line algorithm
0 references
competitive analysis
0 references
approximation algorithm
0 references
asymptotic worst-case ratio
0 references
covering problem
0 references