Optimal on-line algorithms for variable-sized bin covering (Q1306350): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| 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 | |||
Latest revision as of 09:28, 29 May 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
