7930 search results - page 147 / 1586 » Greedy in Approximation Algorithms |
155
click to vote
DGCI
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. The exact, subpixel watershed algorithm delivers very accurate watershed boundaries based on a spline interpolation, but is slow and only works in 2D. On the other hand, ...
153
click to vote
FOCS
2008
IEEE
16 years 25 days ago
2008
IEEE
We introduce several generalizations of classical computer science problems obtained by replacing simpler objective functions with general submodular functions. The new problems i...
164
click to vote
SIAMCOMP
2010
15 years 4 months 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...
222
click to vote
APPROX
2005
Springer
15 years 12 months ago
2005
Springer
The field of stochastic optimization studies decision making under uncertainty, when only probabilistic information about the future is available. Finding approximate solutions to...
157
click to vote
WADS
2007
Springer
16 years 15 days ago
2007
Springer
In this paper, we give a O(log copt)-approximation algorithm for the point guard problem where copt is the optimal number of guards. Our algorithm runs in time polynomial in n, the...