Tight Bounds for Online Vector Scheduling (Q4620410): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Better Bounds for Online Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line routing of virtual circuits with applications to load balancing and machine scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ancient and new algorithms for load balancing in the \(\ell_p\) norm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252723 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds for online vector bin packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Competitiveness of On-Line Assignments / rank
 
Normal rank
Property / cites work
 
Property / cites work: New algorithms for an ancient scheduling problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A better lower bound for on-line scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-Line Load Balancing for Related Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4223058 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579419 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds for selfish and greedy load balancing / 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: On Multidimensional Packing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence and approximation in potential games / 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: Q3031924 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2753936 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952670 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for Certain Multiprocessing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for on-line graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Moser--Tardos Framework with Partial Resampling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Bounds for Online Vector Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Better Algorithm for an Ancient Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach to scheduling on unrelated parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Multidimensional Load Balancing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring random graphs online without creating monochromatic subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selfish load balancing and atomic congestion games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252722 / rank
 
Normal rank

Revision as of 02:10, 18 July 2024

scientific article; zbMATH DE number 7015672
Language Label Description Also known as
English
Tight Bounds for Online Vector Scheduling
scientific article; zbMATH DE number 7015672

    Statements

    Tight Bounds for Online Vector Scheduling (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    8 February 2019
    0 references
    vector scheduling
    0 references
    competitive analysis
    0 references
    identical parallel machines
    0 references
    unrelated parallel machines
    0 references
    makespan
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references