Wiese, Andreas Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Link (Any fulltext)
http://arxiv.org/abs/1403.1376 (Preprint)
Höhn, W., Mestre, J., & Wiese, A. (2014). How Unsplittable-flow-covering Helps Scheduling with Job-dependent Cost Functions. In J. Esparza, P. Fraigniaud, T. Husfeldt, & E. Koutsoupias (Eds.), Automata, Languages, and Programming (pp. 625-636). Berlin: Springer. doi:10.1007/978-3-662-43948-7_52.