Pages that link to "Item:Q5901663"
From MaRDI portal
The following pages link to LATIN 2004: Theoretical Informatics (Q5901663):
Displayed 10 items.
- Minimizing maximum (weighted) flow-time on related and unrelated machines (Q513278) (← links)
- Online weighted flow time and deadline scheduling (Q849627) (← links)
- Primal-dual and dual-fitting analysis of online scheduling algorithms for generalized flow-time problems (Q2319627) (← links)
- Greedy multiprocessor server scheduling (Q2466596) (← links)
- The efficiency-fairness balance of round robin scheduling (Q2670464) (← links)
- Constant Factor Approximation Algorithm for Weighted Flow-Time on a Single Machine in PseudoPolynomial Time (Q5129231) (← links)
- (Q5743472) (← links)
- Competitive kill-and-restart and preemptive strategies for non-clairvoyant scheduling (Q6086005) (← links)
- Approximation schemes for packing problems with \(\ell_p\)-norm diversity constraints (Q6109005) (← links)
- Constant Factor Approximation Algorithm for Weighted Flow-Time on a Single Machine in PseudoPolynomial Time (Q6139826) (← links)