Precedence Scheduling with Unit Execution Time is Equivalent to Parametrized Biclique
From MaRDI portal
Publication:2794373
DOI10.1007/978-3-662-49192-8_27zbMath1442.68071OpenAlexW2398844060MaRDI QIDQ2794373
Maren Kaluza, Felix Land, Klaus Jansen
Publication date: 10 March 2016
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-49192-8_27
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25) Parameterized complexity, tractability and kernelization (68Q27)
Related Items (2)
On the fine-grained parameterized complexity of partial scheduling to minimize the makespan ⋮ Unnamed Item
This page was built for publication: Precedence Scheduling with Unit Execution Time is Equivalent to Parametrized Biclique
