WADS
2007
Springer
14 years 5 months ago
2007
Springer
Distance oracles and graph spanners are excerpts of a graph that allow to compute approximate shortest paths. Here, we consider the situation where it is possible to access the ori...
WADS
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. Assumptions about node density in the Sensor Networks literature are frequently too strong or too weak. Neither absolutely arbitrary nor uniform deployment seem feasible ...
WADS
2007
Springer
14 years 5 months ago
2007
Springer
WADS
2007
Springer
14 years 5 months ago
2007
Springer
In the faulty-memory RAM model, the content of memory cells can get corrupted at any time during the execution of an algorithm, and a constant number of uncorruptible registers are...
WADS
2007
Springer
14 years 5 months ago
2007
Springer
We present new asymptotically tight bounds on cuttings, a fundamental data structure in computational geometry. For n objects in space and a parameter r ∈ N, an 1 r -cutting is ...
WADS
2007
Springer
14 years 5 months ago
2007
Springer
The (Euclidean) Vehicle Routing Allocation Problem (VRAP) is a generalization of Euclidean TSP. We do not require that all points lie on the salesman tour. However, points that do ...
WADS
2007
Springer
14 years 5 months ago
2007
Springer
WADS
2007
Springer
14 years 5 months ago
2007
Springer
Let G = (V, E) be an weighted undirected graph on n vertices and m edges, and let dG be its shortest path metric. We present two simple deterministic algorithms for approximating ...
WADS
2007
Springer
14 years 5 months ago
2007
Springer
While standard parallel machine scheduling is concerned with good assignments of jobs to machines, we aim to understand how the quality of an assignment is affected if the jobs’...
WADS
2007
Springer
14 years 5 months ago
2007
Springer
We study the presence of obstacles in computing BCP(s, t) (Best Coverage Path between two points s and t) in a 2D field under surveillance by sensors. Consider a set of m line seg...