A greedy heuristic for 3-partitioning with similar elements (Q685863): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A performance guarantee for the greedy set-partitioning algorithm / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Latest revision as of 09:57, 22 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A greedy heuristic for 3-partitioning with similar elements |
scientific article |
Statements
A greedy heuristic for 3-partitioning with similar elements (English)
0 references
18 October 1993
0 references
A greedy-type algorithm for a special bin packing problem is described and a tight bound for its relative error is obtained. The bound depends on the ratio \(\beta\) between the greatest and the smallest elements and is valid when \(1\leq \beta\leq 4\).
0 references
greedy-type algorithm
0 references
bin packing
0 references
