Single and multiple device DSA problems, complexities and online algorithms (Q764370): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: OPT versus LOAD in dynamic storage allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for dynamic storage allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4472464 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Linearity of First-Fit Coloring of Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial time approximation algorithm for dynamic storage allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing and Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3128936 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic storage allocation with known durations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing and Combinatorics / rank
 
Normal rank

Latest revision as of 00:29, 5 July 2024

scientific article
Language Label Description Also known as
English
Single and multiple device DSA problems, complexities and online algorithms
scientific article

    Statements

    Single and multiple device DSA problems, complexities and online algorithms (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    13 March 2012
    0 references
    0 references
    dynamic storage allocation
    0 references
    online algorithms
    0 references
    multiple device
    0 references
    NP-completeness
    0 references
    0 references