A note on sorting buffers offline (Q417998): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Almost tight bounds for reordering buffer management / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-hardness of the sorting buffer problem on the uniform metric / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417601 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploiting locality: Approximating sorting buffers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549655 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sequential ordering problem in automotive paint shops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online and offline algorithms for the sorting buffers problem on the line metric / rank
 
Normal rank
Property / cites work
 
Property / cites work: LATIN 2004: Theoretical Informatics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411413 / rank
 
Normal rank

Latest revision as of 05:44, 5 July 2024

scientific article
Language Label Description Also known as
English
A note on sorting buffers offline
scientific article

    Statements

    A note on sorting buffers offline (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    14 May 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    NP-hard
    0 references
    approximation algorithm
    0 references
    resource augmentation
    0 references
    buffer sorting
    0 references
    0 references
    0 references