Pages that link to "Item:Q4575587"
From MaRDI portal
The following pages link to An <i>ℴ</i>(log <i>m</i>)-Competitive Algorithm for Online Machine Minimization (Q4575587):
Displaying 7 items.
- Online in-time service problem with minimal server assignment (Q1740402) (← links)
- Non-preemptive scheduling in a smart grid model and its implications on machine minimization (Q2211351) (← links)
- A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack (Q2400435) (← links)
- An improved algorithm for online machine minimization (Q2417064) (← links)
- Handling Critical Jobs Online: Deadline Scheduling and Convex-Body Chasing (Q4685726) (← links)
- (Q5091067) (← links)
- A general framework for handling commitment in online throughput maximization (Q5918914) (← links)