Pages that link to "Item:Q5741717"
From MaRDI portal
The following pages link to A New Approach to Online Scheduling: Approximating the Optimal Competitive Ratio (Q5741717):
Displaying 9 items.
- An asymptotic competitive scheme for online bin packing (Q896124) (← links)
- Competitive on-line scheduling of continuous-media streams (Q1608317) (← links)
- Improved competitive algorithms for online scheduling with partial job values (Q1884846) (← links)
- Applying ``peeling onion'' approach for competitive analysis in online scheduling with rejection (Q2029304) (← links)
- Improved Upper Bounds on the Competitive Ratio for Online Realtime Scheduling (Q3527235) (← links)
- On-line Scheduling with a Monotonous Subsequence Constraint (Q4632214) (← links)
- Comparing deterministic, robust and online scheduling using entropy (Q4681156) (← links)
- A Constant-Competitive Algorithm for Online OVSF Code Assignment (Q5387778) (← links)
- Algorithms – ESA 2004 (Q5464592) (← links)