scientific article; zbMATH DE number 1182760
From MaRDI portal
Publication:4400843
zbMath0911.90199MaRDI QIDQ4400843
Publication date: 5 May 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (14)
Scheduling with complete multipartite incompatibility graph on parallel machines: complexity and algorithms ⋮ Optimal preemptive online algorithms for scheduling with known largest size on two uniform machines ⋮ A truthful constant approximation for maximizing the minimum load on related machines ⋮ Polynomial-time combinatorial algorithm for general max-min fair allocation ⋮ General max-min fair allocation ⋮ Parallel machine covering with limited number of preemptions ⋮ An efficient polynomial time approximation scheme for load balancing on uniformly related machines ⋮ Vector assignment schemes for asymmetric settings ⋮ Optimal semi-online preemptive algorithms for machine covering on two uniform machines ⋮ Approximation schemes for scheduling and covering on unrelated machines ⋮ A Unified Approach to Truthful Scheduling on Related Machines ⋮ Maximizing the Minimum Load for Selfish Agents ⋮ Maximizing the minimum load for selfish agents ⋮ Preemptive machine covering on parallel machines
This page was built for publication:
