Pages that link to "Item:Q487001"
From MaRDI portal
The following pages link to A model for minimizing active processor time (Q487001):
Displaying 11 items.
- On the Price of Anarchy of cost-sharing in real-time scheduling systems (Q777962) (← links)
- LP rounding and combinatorial algorithms for minimizing active and busy time (Q1702663) (← links)
- A new LP rounding algorithm for the active time problem (Q2066698) (← links)
- Minimum hitting set of interval bundles problem: computational complexity and approximability (Q2161003) (← links)
- (Q2912849) (redirect page) (← links)
- Scheduling Tasks to Minimize Active Time on a Processor with Unlimited Capacity (Q2988826) (← links)
- Active and Busy Time Scheduling Problem: A Survey (Q3297831) (← links)
- Cost-sharing games in real-time scheduling systems (Q5918882) (← links)
- Complexity and online algorithms for minimum skyline coloring of intervals (Q5919565) (← links)
- Cost-sharing games in real-time scheduling systems (Q5925633) (← links)
- Security-aware database migration planning (Q6154181) (← links)
