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 10 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)
- Maximizing the minimum load for selfish agents (Q1041221) (← 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)
- Approximation schemes for scheduling and covering on unrelated machines (Q2503309) (← links)
- A Unified Approach to Truthful Scheduling on Related Machines (Q2800378) (← links)
- Bi-Criteria Approximation Algorithms for Load Balancing on Unrelated Machines with Costs (Q6065410) (← links)
