A tight bound for 3-partitioning (Q1309812): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Bounds on Multiprocessing Timing Anomalies / rank | |||
Normal rank | |||
Latest revision as of 11:04, 22 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A tight bound for 3-partitioning |
scientific article |
Statements
A tight bound for 3-partitioning (English)
0 references
4 January 1994
0 references
3-partition
0 references
worst-case analysis
0 references
LPT-algorithm
0 references
multiprocessor scheduling
0 references
