7930 search results - page 108 / 1586 » Greedy in Approximation Algorithms |
160
click to vote
SODA
2001
ACM
15 years 7 months ago
2001
ACM
We give an implementation of the Goemans-Williamson clustering procedure which is at the core of several approximation algorithms including those for Generalized Steiner Trees, Pr...
179
click to vote
ROBOCUP
2007
Springer
16 years 12 days ago
2007
Springer
This article investigates the prerequisites for a global exploration strategy in an unknown environment on a virtual disaster site. Assume that a robot equipped with a laser range...
169
click to vote
ICNP
2005
IEEE
15 years 12 months ago
2005
IEEE
Existing geographic routing algorithms depend on the planarization of the network connectivity graph for correctness, and the planarization process gives rise to a welldefined no...
143
click to vote
APPROX
2006
Springer
15 years 10 months ago
2006
Springer
We describe a simple random-sampling based procedure for producing sparse matrix approximations. Our procedure and analysis are extremely simple: the analysis uses nothing more th...
144
click to vote
ICMCS
2006
IEEE
16 years 10 days ago
2006
IEEE
We address the problem of distributed path selection and rate allocation for media streaming in overlay networks. Under the assumption that each node has only a local view of the ...