Moderately exponential approximation for makespan minimization on related machines
From MaRDI portal
Publication:392019
DOI10.1016/J.TCS.2013.03.020zbMATH Open1359.90040OpenAlexW1976329942MaRDI QIDQ392019FDOQ392019
Authors: Marin Bougeret, Pierre-Francois Dutot, Denis Trystram 
Publication date: 13 January 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2013.03.020
Recommendations
- An efficient approximation algorithm for minimizing makespan on uniformly related machines.
- scientific article; zbMATH DE number 1187166
- An optimal rounding gives a better approximation for scheduling unrelated machines
- Approximation algorithms for scheduling unrelated parallel machines
- Improved approximation schemes for scheduling unrelated parallel machines
Cites Work
- Title not available (Why is that?)
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
- Exact and Approximate Algorithms for Scheduling Nonidentical Processors
- Approximation algorithms for scheduling unrelated parallel machines
- Tighter bound for MULTIFIT scheduling on uniform processors
- Bounds for Multifit Scheduling on Uniform Processors
- Bounds for LPT Schedules on Uniform Processors
- Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms
- An EPTAS for scheduling jobs on uniform processors: using an MILP relaxation with a constant number of integral variables
- Grouping techniques for scheduling problems: simpler and faster
Cited In (1)
This page was built for publication: Moderately exponential approximation for makespan minimization on related machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q392019)
