Pages that link to "Item:Q2503309"
From MaRDI portal
The following pages link to Approximation schemes for scheduling and covering on unrelated machines (Q2503309):
Displaying 18 items.
- A truthful constant approximation for maximizing the minimum load on related machines (Q388122) (← links)
- An efficient polynomial time approximation scheme for load balancing on uniformly related machines (Q463715) (← links)
- Unrelated parallel machine scheduling -- perspectives and progress (Q505093) (← links)
- Approximate algorithms for unrelated machine scheduling to minimize makespan (Q747046) (← links)
- Maximizing the minimum load for selfish agents (Q1041221) (← links)
- Approximation schemes for scheduling on parallel machines (Q1268852) (← links)
- 2-approximation algorithm for a generalization of scheduling on unrelated parallel machines (Q1799571) (← links)
- Multipurpose machine scheduling with rejection and identical job processing times (Q2018939) (← links)
- Improved bi-criteria approximation schemes for load balancing on unrelated machines with cost constraints (Q2222091) (← links)
- A new approach for bicriteria partitioning problem (Q2355323) (← links)
- An optimal rounding gives a better approximation for scheduling unrelated machines (Q2488212) (← links)
- Approximation schemes for scheduling and covering on unrelated machines (Q2503309) (← links)
- A unified approach to truthful scheduling on related machines (Q2800378) (← links)
- Improved approximation schemes for scheduling unrelated parallel machines (Q2819574) (← links)
- Approximation Algorithms for Unrelated Machine Scheduling with an Energy Budget (Q3004675) (← links)
- On the Configuration-LP for Scheduling on Unrelated Machines (Q3092258) (← links)
- How Unsplittable-Flow-Covering Helps Scheduling with Job-Dependent Cost Functions (Q5167778) (← links)
- Bi-Criteria Approximation Algorithms for Load Balancing on Unrelated Machines with Costs (Q6065410) (← links)
