|
| << previous | next >> |
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
Details for article 31 of 1210 found articles
| Title: |
A faster 2-approximation algorithm for the minmax p-traveling salesmen problem on a tree |
| Author: |
Nagamochi, Hiroshi Okada, Kohei |
| Appeared in: |
Discrete applied mathematics |
| Paging: | Volume 140 (2004) nr. 1-3 pages 12 p. |
| Year: |
2004 |
| Contents: | |
| Publisher: |
Elsevier B.V. |
| Source file: |
Elektronische Wetenschappelijke Tijdschriften |
Details for article 31 of 1210 found articles
| << previous | next >> |