Pages that link to "Item:Q5930157"
From MaRDI portal
The following pages link to Ancient and new algorithms for load balancing in the \(\ell_p\) norm (Q5930157):
Displaying 22 items.
- Fair online load balancing (Q398848) (← links)
- A novel robust on-line protocol for load-balancing in structured peer-to-peer systems (Q455942) (← links)
- An efficient polynomial time approximation scheme for load balancing on uniformly related machines (Q463715) (← links)
- Online scheduling with rejection and reordering: exact algorithms for unit size jobs (Q489737) (← links)
- Tight bounds for selfish and greedy load balancing (Q644806) (← links)
- On-line load balancing made simple: greedy strikes back (Q924556) (← links)
- Applying extra-resource analysis to load balancing. (Q1588056) (← links)
- Semi-online hierarchical scheduling for \(l_p\)-norm load balancing with buffer or rearrangements (Q1680761) (← links)
- Minimizing the maximum starting time on-line (Q1763375) (← links)
- Optimal on-line algorithms for the uniform machine scheduling problem with ordinal data (Q1767979) (← links)
- Offline file assignments for online load balancing (Q1944067) (← links)
- On-line preemptive machine scheduling with \(\ell _p\) norm on two uniform machines (Q2341395) (← links)
- A system-centric metric for the evaluation of online job schedules (Q2434258) (← links)
- Best compromise solution for a new multiobjective scheduling problem (Q2489291) (← links)
- Load balancing of temporary tasks in the \(\ell _{p}\) norm (Q2503355) (← links)
- Approximate majorization and fair online load balancing (Q2768323) (← links)
- Generalizing the Kawaguchi-Kyan bound to stochastic parallel machine scheduling (Q3304142) (← links)
- A Lower Bound for the On-Line Preemptive Machine Scheduling with ℓ p Norm (Q3511378) (← links)
- Tight Bounds for Online Vector Scheduling (Q4620410) (← links)
- Semi-Online Hierarchical Scheduling on Two Machines for lp-Norm Load Balancing (Q4631681) (← links)
- Approximating the Optimal Algorithm for Online Scheduling Problems via Dynamic Programming (Q5245846) (← links)
- Approximation and Online Algorithms (Q5896922) (← links)