1082 search results - page 29 / 217 » Approximation Algorithms for Spreading Points |
IPCO
2001
13 years 9 months ago
2001
Garg [10] gives two approximation algorithms for the minimum-cost tree spanning k vertices in an undirected graph. Recently Jain and Vazirani [16] discovered primal-dual approxima...
TMI
2008
13 years 7 months ago
2008
For multi-pinhole SPECT, iterative reconstruction algorithms are preferred over analytical methods, because of the often complex multi-pinhole geometries and the ability of iterat...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
The topological properties of a network directly impact the flow of information through a system. For example, in natural populations, the network of inter-individual contacts aff...
ESA
2005
Springer
14 years 1 months ago
2005
Springer
Let A and B be two sets of m resp. n weighted points in the plane, with m ≤ n. We present (1 + ) and (2+ )-approximation algorithms for the minimum Euclidean Earth Mover’s Dis...
INFOCOM
2011
IEEE
12 years 11 months ago
2011
IEEE
—Information dissemination in a large network is typically achieved when each user shares its own information or resources with each other user. Consider n users randomly located...