854 search results - page 83 / 171 » A General Vehicle Routing Problem |
COCOON
2008
Springer
13 years 10 months ago
2008
Springer
This paper describes a general quantum lower bounding technique for the communication complexity of a function that depends on the inputs given to two parties connected via paths,...
GIS
2003
ACM
14 years 10 months ago
2003
ACM
Nearest neighbor query is one of the most important operations in spatial databases and their application domains, e.g., locationbased services, advanced traveler information syst...
CORR
2007
Springer
13 years 9 months ago
2007
Springer
The k-forest problem is a common generalization of both the k-MST and the dense-k-subgraph problems. Formally, given a metric space on n vertices V , with m demand pairs ⊆ V × ...
ANCS
2007
ACM
14 years 1 months ago
2007
ACM
To realize a path in an InfiniBand network, an address, known as Local IDentifier (LID) in the InfiniBand specification, must be assigned to the destination and used in the forwar...
INFOCOM
1998
IEEE
14 years 1 months ago
1998
IEEE
We consider the problem of constructing logical topologies over a wavelength-routed optical network with no wavelength changers. We present a general linear formulation which consi...