Matthias Mnich and René van Bevern. Parameterized complexity of machine scheduling: 15 open problems. 2017.

Machine scheduling problems are a long-time key domain of algorithms and complexity research. A novel approach to machine scheduling problems are fixed-parameter algorithms. To stimulate this thriving research direction, we propose 15 interesting open questions in this area.

bib | http ] Back

This file was generated by bibtex2html 1.98.