99 search results - page 9 / 20 » Distance Approximation in Bounded-Degree and General Sparse ... |
ICALP
2011
Springer
12 years 11 months ago
2011
Springer
We present an O( √ n log n)-approximation algorithm for the problem of finding the sparsest spanner of a given directed graph G on n vertices. A spanner of a graph is a sparse ...
ICRA
2000
IEEE
13 years 11 months ago
2000
IEEE
We present techniques for fast motion planning by using discrete approximations of generalized Voronoi diagrams, computed with graphics hardware. Approaches based on this diagram ...
FSTTCS
1993
Springer
13 years 11 months ago
1993
Springer
We investigate the complexity and approximability of some location problems when two distance values are specified for each pair of potential sites. These problems involve the se...
ICALP
2007
Springer
14 years 1 months ago
2007
Springer
A spanner of an undirected unweighted graph is a subgraph that approximates the distance metric of the original graph with some specified accuracy. Specifically, we say H ⊆ G i...
SWAT
2004
Springer
14 years 22 days ago
2004
Springer
Given an edge-distance graph of a set of suppliers and clients, the bottleneck problem is to assign each client to a selected supplier minimizing their maximum distance. We introdu...