Hiroshi Nagamochi Kohei Okada A faster 2-approximation algorithm for the minmax p-traveling salesmen problem on a tree. 103-114 2004 140 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2003.06.001 db/journals/dam/dam140.html#NagamochiO04