Estimation of the Absolute Error and Polynomial Solvability for a Classical NP-Hard Scheduling Problem
Crossref DOI link: https://doi.org/10.1134/S1064562418030201
Published Online: 2018-07-16
Published Print: 2018-05
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Lazarev, A. A.
Arkhipov, D. I.
Text and Data Mining valid from 2018-05-01
Article History
Received: 9 February 2018
First Online: 16 July 2018