Tighter bounds on a heuristic for a partition problem (Q1350239): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-Case Analysis of a Placement Algorithm Related to Storage Allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Record Allocation for Minimizing Expected Retrieval Costs on Drum-Like Storage Devices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on Multiprocessing Timing Anomalies / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:04, 27 May 2024

scientific article
Language Label Description Also known as
English
Tighter bounds on a heuristic for a partition problem
scientific article

    Statements

    Tighter bounds on a heuristic for a partition problem (English)
    0 references
    0 references
    27 February 1997
    0 references
    0 references
    Discrete minimization
    0 references
    Partition
    0 references
    Storage allocation
    0 references
    NP-hard
    0 references
    Algorithms
    0 references
    Approximation algorithms
    0 references
    Worst-case bound
    0 references