Primal-dual and dual-fitting analysis of online scheduling algorithms for generalized flow-time problems (Q2319627): Difference between revisions

From MaRDI portal
Merged Item from Q3452766
Created claim: Wikidata QID (P12): Q127885944, #quickstatements; #temporary_batch_1722372779079
 
(2 intermediate revisions by one other user not shown)
Property / cites work
 
Property / cites work: Primal-dual and dual-fitting analysis of online scheduling algorithms for generalized flow-time problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-off Schedules / rank
 
Normal rank
Property / cites work
 
Property / cites work: LATIN 2004: Theoretical Informatics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online weighted flow time and deadline scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal Dual Gives Almost Optimal Energy-Efficient Online Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Non-clairvoyant Scheduling to Simultaneously Minimize All Convex Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Primal-Dual for Non-linear Optimization with Applications to Speed Scaling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive algorithms from competitive equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Scheduling with General Cost Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Speed is as powerful as clairvoyance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangian Duality in Online Scheduling with Resource Augmentation and Speed Scaling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743472 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4633939 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal Dual Gives Almost Optimal Energy Efficient Online Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling in the dark / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scalably scheduling processes with arbitrary speedup curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743473 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scalably Scheduling Power-Heterogeneous Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: How Unsplittable-Flow-Covering Helps Scheduling with Job-Dependent Cost Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonclairvoyant scheduling / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127885944 / rank
 
Normal rank

Latest revision as of 23:01, 30 July 2024

scientific article; zbMATH DE number 6511756
  • Primal-Dual and Dual-Fitting Analysis of Online Scheduling Algorithms for Generalized Flow Time Problems
Language Label Description Also known as
English
Primal-dual and dual-fitting analysis of online scheduling algorithms for generalized flow-time problems
scientific article; zbMATH DE number 6511756
  • Primal-Dual and Dual-Fitting Analysis of Online Scheduling Algorithms for Generalized Flow Time Problems

Statements

Primal-dual and dual-fitting analysis of online scheduling algorithms for generalized flow-time problems (English)
0 references
Primal-Dual and Dual-Fitting Analysis of Online Scheduling Algorithms for Generalized Flow Time Problems (English)
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
20 August 2019
0 references
19 November 2015
0 references
0 references
0 references
0 references
0 references
0 references
online algorithms
0 references
primal-dual
0 references
dual-fitting
0 references
generalized flow-time
0 references
scheduling
0 references
0 references
0 references
0 references
0 references