509 search results - page 8 / 102 » Lower Bounds for Approximation Algorithms for the Steiner Tr... |
STOC
2003
ACM
14 years 7 months ago
2003
ACM
In this paper, we show that any n point metric space can be embedded into a distribution over dominating tree metrics such that the expected stretch of any edge is O(log n). This ...
ISAAC
1993
Springer
13 years 11 months ago
1993
Springer
JISE
2006
13 years 7 months ago
2006
CIAC
2006
Springer
13 years 11 months ago
2006
Springer
ICALP
2005
Springer
14 years 26 days ago
2005
Springer
We define an algorithmic paradigm, the stack model, that captures many primal-dual and local-ratio algorithms for approximating covering and packing problems. The stack model is ...