FPT approximation algorithm for scheduling with memory constraints

DOI10.1007/978-3-319-43659-3_15zbMath1377.68046OpenAlexW2524601206MaRDI QIDQ1693210

Franck Ledoux, Damien Regnault, Eric Angel, Sébastien Morais, Cédric Chevalier

Publication date: 11 January 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-43659-3_15

zbMATH Keywords

schedulingdynamic programmingapproximation algorithmfixed-parameter tractable

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)

Related Items (1)

Simultaneous Computational and Data Load Balancing in Distributed-Memory Setting

This page was built for publication: FPT approximation algorithm for scheduling with memory constraints