Pages that link to "Item:Q3387928"
From MaRDI portal
The following pages link to Closing the Gap for Makespan Scheduling via Sparsification Techniques (Q3387928):
Displaying 9 items.
- EPTAS for load balancing problem on parallel machines with a non-renewable resource (Q2085740) (← links)
- Empowering the configuration-IP: new PTAS results for scheduling with setup times (Q2089776) (← links)
- Approximation results for makespan minimization with budgeted uncertainty (Q5919095) (← links)
- Algorithms for single machine scheduling problem with release dates and submodular penalties (Q6039534) (← links)
- EPTAS for the dual of splittable bin packing with cardinality constraint (Q6057843) (← links)
- EPTAS for load balancing problem on parallel machines with a non-renewable resource (Q6108926) (← links)
- EPTAS for parallel identical machine scheduling with time restrictions (Q6123390) (← links)
- Randomized approximation schemes for minimizing the weighted makespan on identical parallel machines (Q6126818) (← links)
- Scheduling games with rank-based utilities (Q6160122) (← links)
