Pages that link to "Item:Q2415372"
From MaRDI portal
The following pages link to A unified framework for designing EPTAS for load balancing on parallel machines (Q2415372):
Displaying 15 items.
- An efficient polynomial time approximation scheme for load balancing on uniformly related machines (Q463715) (← links)
- A unified framework for designing EPTAS's for load balancing on parallel machines (Q1670744) (← links)
- Approximation algorithms for the multiprocessor scheduling with submodular penalties (Q2047204) (← links)
- EPTAS for load balancing problem on parallel machines with a non-renewable resource (Q2085740) (← links)
- Scheduling with complete multipartite incompatibility graph on parallel machines: complexity and algorithms (Q2152489) (← links)
- Improved bi-criteria approximation schemes for load balancing on unrelated machines with cost constraints (Q2222091) (← links)
- Fair and efficient allocation with few agent types, few item types, or small value levels (Q2680786) (← links)
- A highly OR-parallel inference machine (Multi-ASCA) and its performance evaluation: an architecture and its load balancing algorithms (Q4419761) (← links)
- Bi-Criteria Approximation Algorithms for Load Balancing on Unrelated Machines with Costs (Q6065410) (← 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)
- Bag-of-tasks scheduling with rejection in large computing systems (Q6542877) (← links)
- Approximation algorithms for job scheduling with block-type conflict graphs (Q6568400) (← links)
- The prize-collecting single machine scheduling with bounds and penalties (Q6621854) (← links)
