Scheduling Partially Ordered Jobs Faster Than 2 n
From MaRDI portal
Publication:3092238
DOI10.1007/978-3-642-23719-5_26zbMath1346.90336arXiv1108.0810MaRDI QIDQ3092238
Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk, Jakub Onufry Wojtaszczyk
Publication date: 16 September 2011
Published in: Algorithms – ESA 2011 (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1108.0810
68Q25: Analysis of algorithms and problem complexity
90B35: Deterministic scheduling theory in operations research