58 search results - page 12 / 12 » Approximation algorithms for deadline-TSP and vehicle routin... |
ESA
2009
Springer
13 years 12 months ago
2009
Springer
Dial-a-Ride problems consist of a set V of n vertices in a metric space (denoting travel time between vertices) and a set of m objects represented as source-destination pairs {(si,...
ESA
2007
Springer
13 years 11 months ago
2007
Springer
In this paper we study several routing problems that generalize shortest paths and the Traveling Salesman Problem. We consider a more general model that incorporates the actual co...
COCOA
2009
Springer
13 years 10 months ago
2009
Springer
: Under water sensor network is an important research direction in computer science. There are many interesting optimization problems regarding its design, routing and applications...