On minimizing dataset transfer time in an acyclic network with four servers Full article

Journal	Journal of Applied and Industrial Mathematics ISSN: 1990-4789 , E-ISSN: 1990-4797
Output data	Year: 2016, Volume: 10, Number: 4, Pages: 494-504 Pages count : 11 DOI: 10.1134/s1990478916040050
Tags	multiprocessor scheduling; NP-hardness; polynomial time algorithm
Authors	Kononov A.V. 1,2 , Kononova P.A. 1,2
Affiliations	1 Sobolev Institute of Mathematics, pr. Akad. Koptyuga 4, Novosibirsk, 630090 Russia 2 Novosibirsk State University, ul. Pirogova 2, Novosibirsk, 630090 Russia