44 search results - page 4 / 9 » Poly-logarithmic Approximation Algorithms for Directed Vehic... |
ESA
2007
Springer
15 years 5 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...
111
click to vote
ROBOCOMM
2007
IEEE
15 years 5 months ago
2007
IEEE
— Consider the following scenario: a spatio-temporal stochastic process generates service requests, localized at points in a bounded region on the plane; these service requests a...
HEURISTICS
2008
14 years 11 months ago
2008
In this talk we present a unified Variable Neighborhood Search (VNS) algorithm for the Capacitated Arc Routing Problem (CARP) and some of its variants - the Capacitated Arc Routin...
DAGSTUHL
2007
15 years 1 months ago
2007
We consider the problems of set partitioning into k clusters with minimum total cost and minimum of the maximum cost of a cluster. The cost function is given by an oracle, and we ...
ECCC
2006
14 years 11 months ago
2006
Given a graph G and a collection of source-sink pairs in G, what is the least integer c such that each source can be connected by a path to its sink, with at most c paths going th...