7930 search results - page 412 / 1586 » Greedy in Approximation Algorithms |
188
click to vote
SIBGRAPI
2003
IEEE
16 years 2 days 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...
270
click to vote
FOCS
2000
IEEE
15 years 11 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...
141
click to vote
FOCS
1996
IEEE
15 years 11 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...
159
click to vote
SIAMCOMP
2008
15 years 6 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...
157
click to vote
IPL
2007
15 years 6 months ago
2007
We observe that combining the techniques of Arora, Rao, and Vazirani, with the rounding algorithm of Rao and Richa yields an O( √ log n log log n)-approximation for the minimum-...