The \(k\)-partitioning problem (Q1298757): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
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
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01193837 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2065011764 / rank
 
Normal rank

Latest revision as of 11:11, 30 July 2024

scientific article
Language Label Description Also known as
English
The \(k\)-partitioning problem
scientific article

    Statements

    The \(k\)-partitioning problem (English)
    0 references
    0 references
    0 references
    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

    Identifiers