7006 search results - page 303 / 1402 » Approximation Algorithms |
240
Voted
GIS
2007
ACM
16 years 5 months ago
2007
ACM
Handling streams of positional updates from numerous moving objects has become a challenging task for many monitoring applications. Several algorithms have been recently proposed ...
140
click to vote
SIBGRAPI
2003
IEEE
15 years 9 months ago
2003
IEEE
We describe a new method for surface reconstruction based on unorganized point clouds without normals. We also present a new algorithm for refining the inital triangulation. The o...
181
Voted
FOCS
2000
IEEE
15 years 8 months ago
2000
IEEE
A bisection of a graph with n vertices is a partition of its vertices into two sets, each of size n/2. The bisection cost is the number of edges connecting the two sets. The proble...
106
click to vote
FOCS
1996
IEEE
15 years 8 months ago
1996
IEEE
In thispaper we give a 3-approximationalgorithmfor the problem ojJnding a minimum tree spanning any k-vertices in a graph. Our algorithm extends to a 3-approximationalgorithmfor t...
112
click to vote
SIAMCOMP
2008
15 years 3 months ago
2008
We give an algorithm requiring O(c1/2 n) time to find an -optimal traveling salesman tour in the shortest-path metric defined by an undirected planar graph with nonnegative edgele...