467 search results - page 69 / 94 » Acceleration of Shortest Path and Constrained Shortest Path ... |
COMPGEOM
2004
ACM
14 years 24 days ago
2004
ACM
Let P be a simple polygon with m vertices, k of which are reflex, and which contains r red points and b blue points in its interior. Let n = m + r + b. A ham-sandwich geodesic is ...
EOR
2007
13 years 7 months ago
2007
This paper studies an arc routing problem with capacity constraints and time-dependent service costs. This problem is motivated by winter gritting applications where the ‘‘tim...
PVLDB
2008
13 years 6 months ago
2008
The class of k Nearest Neighbor (kNN) queries is frequently used in geospatial applications. Many studies focus on processing kNN in Euclidean and road network spaces. Meanwhile, ...
EOR
2007
13 years 7 months ago
2007
An instance of a p-median problem gives n demand points. The objective is to locate p supply points in order to minimize the total distance of the demand points to their nearest s...
BROADNETS
2007
IEEE
14 years 1 months ago
2007
IEEE
— Traffic engineering has been extensively studied to maximize network resource utilization while minimizing call blocking [1]. As the the demand for high data rate services ove...