6110 search results - page 78 / 1222 » Approximate Computing |
122
Voted
FOCS
2008
IEEE
15 years 9 months ago
2008
IEEE
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 ...
75
Voted
ICALP
2009
Springer
15 years 9 months ago
2009
Springer
PERCOM
2006
ACM
15 years 8 months ago
2006
ACM
ENC
2005
IEEE
15 years 8 months ago
2005
IEEE
88
Voted
ICALP
2003
Springer
15 years 7 months ago
2003
Springer