(\(1+\varepsilon \))-competitive algorithm for online OVSF code assignment with resource augmentation (Q386436): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4252268 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Tree Node Assignment with Resource Augmentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A constant-competitive algorithm for online OVSF code assignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online OVSF Code Assignment with Resource Augmentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online bin packing with resource augmentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: STACS 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Bandwidth Allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Speed is as powerful as clairvoyance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving the competitive ratio of the online OVSF code assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal time-critical scheduling via resource augmentation / rank
 
Normal rank

Latest revision as of 03:09, 7 July 2024

scientific article
Language Label Description Also known as
English
(\(1+\varepsilon \))-competitive algorithm for online OVSF code assignment with resource augmentation
scientific article

    Statements

    (\(1+\varepsilon \))-competitive algorithm for online OVSF code assignment with resource augmentation (English)
    0 references
    0 references
    0 references
    0 references
    9 December 2013
    0 references
    online OVSF code assignment problem
    0 references
    resource augmentation
    0 references
    competitive algorithm
    0 references

    Identifiers