![]() |
@article{DBLP:journals/dam/NagamochiO04,
author = {Hiroshi Nagamochi and
Kohei Okada},
title = {A faster 2-approximation algorithm for the minmax p-traveling
salesmen problem on a tree},
journal = {Discrete Applied Mathematics},
volume = {140},
number = {1-3},
year = {2004},
pages = {103-114},
ee = {http://dx.doi.org/10.1016/j.dam.2003.06.001},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Copyright © 2004-07-07 by Michael Ley (ley@uni-trier.de)