9 search results - page 1 / 2 » esa 1998 |
ESA
1998
Springer
13 years 11 months ago
1998
Springer
ESA
1998
Springer
13 years 11 months ago
1998
Springer
We give two, new upper bounds for oblivious permutation routing on the mesh networks: Let N be the total number of processors in each mesh. One is an O(N0.75 ) algorithm on the tw...
ESA
1998
Springer
13 years 11 months ago
1998
Springer
An ordered tree is a tree in which each node's incident edges are cyclically ordered; think of the tree as being embedded in the plane. Let A and B be two ordered trees. The e...
ESA
1998
Springer
13 years 11 months ago
1998
Springer
Previous literature on the Traveling Salesman Problem (TSP) assumed that the sites to be visited are stationary. Motivated by practical applications, we introduce a time-dependent ...
ESA
1998
Springer
13 years 11 months ago
1998
Springer
Information retrieval and data compression are the two main application areas where the rich theory of string algorithmics plays a fundamental role. In this paper, we consider one ...