History
Year:
-
Type:
Journal
Book
Article
Please fill in your query. A complete syntax description you will find on the General Help page.
first | previous | 1 | next | last

Result 1 to 6 from 6 total

The moving-target traveling salesman problem. (English)
J. Algorithms 49, No. 1, 153-174 (2003).
WorldCat.org
1
An improved approximation scheme for the group Steiner Problem. (English)
Networks 37, No.1, 8-20 (2001).
WorldCat.org
2
New approximation algorithms for routing with multiport terminals. (English)
IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst. 19, No. 10, 1118-1128 (2000).
WorldCat.org
3
Moving-target TSP and related problems. (English)
Bilardi, Gianfranco (ed.) et al., Algorithms - ESA ’98. 6th annual European symposium, Venice, Italy, August 24‒26, 1998. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1461, 453-464 (1998).
WorldCat.org
4
Improved Approximation Bounds for the Group Steiner Problem. (English)
DATE, 406-413(1998)
WorldCat.org
5
Provably good routing tree construction with multi-port terminals. (English)
ISPD, 96-102(1997)
WorldCat.org
6
first | previous | 1 | next | last

Result 1 to 6 from 6 total

Valid XHTML 1.0 Transitional Valid CSS!