80 search results - page 3 / 16 » A New Approximation Algorithm for Computing 2-Restricted Dis... |
119
Voted
COMPGEOM
2004
ACM
15 years 7 months ago
2004
ACM
We revisit the problem of computing shortest obstacle-avoiding paths among obstacles in three dimensions. We prove new hardness results, showing, e.g., that computing Euclidean sh...
114
click to vote
SIAMCOMP
2010
15 years 24 days ago
2010
Let G = (V, E) be a weighted undirected graph having non-negative edge weights. An estimate ˆδ(u, v) of the actual distance δ(u, v) between u, v ∈ V is said to be of stretch t...
115
Voted
STACS
2010
Springer
15 years 9 months ago
2010
Springer
We present two new approximation algorithms with (improved) constant ratios for selecting n points in n unit disks such that the minimum pairwise distance among the points is maxi...
312
click to vote
COCOON
2011
Springer
14 years 2 months ago
2011
Springer
Motivated by a security problem in geographic information systems, we study the following graph theoretical problem: given a graph G, two special nodes s and t in G, and a number k...
125
Voted
LCN
1999
IEEE
15 years 6 months ago
1999
IEEE
This paper presents the new Shortest Best Path Tree (SBPT) algorithm for multicast trees. The SBPT algorithm establishes and maintains dynamic multicast trees which maximize the b...