Sciweavers

6110 search results - page 78 / 1222
» Approximate Computing
Sort
View
FOCS
2008
IEEE
16 years 19 days ago
A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest
We give a randomized O(n polylog n)-time approximation scheme for the Steiner forest problem in the Euclidean plane. For every fixed ǫ > 0 and given n terminals in the plane ...
Glencora Borradaile, Philip N. Klein, Claire Mathi...
ICALP
2009
Springer
16 years 29 days ago
Approximating Matches Made in Heaven
Ning Chen, Nicole Immorlica, Anna R. Karlin, Moham...
PERCOM
2006
ACM
16 years 5 days ago
Hardness and approximation of Gathering in static radio networks
Jean-Claude Bermond, Nelson Morales, Stépha...
ICALP
2003
Springer
15 years 11 months ago
An Improved Approximation Algorithm for Vertex Cover with Hard Capacities
Rajiv Gandhi, Eran Halperin, Samir Khuller, Guy Ko...