scientific article; zbMATH DE number 1182760
From MaRDI portal
Publication:4400843
Recommendations
- Approximation schemes for scheduling and covering on unrelated machines
- scientific article; zbMATH DE number 1405790
- Improved approximation schemes for scheduling unrelated parallel machines
- Approximation algorithms for scheduling unrelated parallel machines
- Approximation schemes for scheduling on parallel machines
Cited in
(18)- Maximizing the minimum load for selfish agents
- Scheduling with complete multipartite incompatibility graph on parallel machines: complexity and algorithms
- Vector assignment schemes for asymmetric settings
- Approximation schemes for scheduling and covering on unrelated machines
- Preemptive machine covering on parallel machines
- General max-min fair allocation
- A unified approach to truthful scheduling on related machines
- A combination of parallel machine scheduling and the covering problem
- A truthful constant approximation for maximizing the minimum load on related machines
- Parallel machine covering with limited number of preemptions
- An efficient polynomial time approximation scheme for load balancing on uniformly related machines
- Constant approximation for the lifetime scheduling problem of \(p\)-percent coverage
- Maximizing the Minimum Load for Selfish Agents
- Optimal semi-online preemptive algorithms for machine covering on two uniform machines
- Polynomial-time combinatorial algorithm for general max-min fair allocation
- Robust scheduling on uniform machines. New results using a relaxed approximation guarantee
- New support size bounds for integer programming, applied to makespan minimization on uniformly related machines
- Optimal preemptive online algorithms for scheduling with known largest size on two uniform machines
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4400843)
