Hardness of Routing for Minimizing Superlinear Polynomial Cost in Directed Graphs.

Yangguang Shi, Fa Zhang, Zhiyong Liu

Browse the full TAMC paper archive.