Pages that link to "Item:Q5919620"
From MaRDI portal
The following pages link to An EPTAS for scheduling on unrelated machines of few different types (Q5919620):
Displaying 12 items.
- Scheduling with complete multipartite incompatibility graph on parallel machines: complexity and algorithms (Q2152489) (← links)
- Makespan minimization on unrelated parallel machines with a few bags (Q2173300) (← links)
- Structural parameters for scheduling with assignment restrictions (Q2205947) (← links)
- Improved bi-criteria approximation schemes for load balancing on unrelated machines with cost constraints (Q2222091) (← links)
- A unified framework for designing EPTAS for load balancing on parallel machines (Q2415372) (← links)
- Fair and efficient allocation with few agent types, few item types, or small value levels (Q2680786) (← links)
- A PTAS for Scheduling Unrelated Machines of Few Different Types (Q5895057) (← links)
- Approximation results for makespan minimization with budgeted uncertainty (Q5919095) (← links)
- (Q5920108) (redirect page) (← links)
- Bi-Criteria Approximation Algorithms for Load Balancing on Unrelated Machines with Costs (Q6065410) (← 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)
