Yangguang Shi, Fa Zhang, Zhiyong Liu. Hardness of Routing for Minimizing Superlinear Polynomial Cost in Directed Graphs. In T. V. Gopal, Gerhard Jäger, Silvia Steila, editors, Theory and Applications of Models of Computation - 14th Annual Conference, TAMC 2017, Bern, Switzerland, April 20-22, 2017, Proceedings. Volume 10185 of Lecture Notes in Computer Science, pages 571-585, 2017. [doi]
Abstract is missing.