The \(k\)-partitioning problem (Q1298757): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: A note on LPT scheduling / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An Application of Bin-Packing to Multiprocessor Scheduling / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Bounds for Certain Multiprocessing Anomalies / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Bounds on Multiprocessing Timing Anomalies / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A 3/2-approximation algorithm for \(k_i\)-partitioning / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A tight bound for 3-partitioning / rank | |||
Normal rank |
Revision as of 20:47, 28 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The \(k\)-partitioning problem |
scientific article |
Statements
The \(k\)-partitioning problem (English)
0 references
22 August 1999
0 references
partition
0 references
multiprocessor scheduling
0 references
worst-case
0 references
heuristics
0 references
folding algorithm
0 references