27 search results - page 3 / 6 » An Improved LP-based Approximation for Steiner Tree |
EOR
2008
13 years 5 months ago
2008
This article describes and compares three heuristics for a variant of the Steiner tree problem with revenues, which includes budget and hop constraints. First, a greedy method whi...
ESA
2003
Springer
13 years 10 months ago
2003
Springer
We prove that various geometric covering problems, related to the Travelling Salesman Problem cannot be efficiently approximated to within any constant factor unless P = NP. This ...
SODA
1992
ACM
13 years 6 months ago
1992
ACM
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...
STOC
2003
ACM
14 years 5 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 ...
CDC
2009
IEEE
13 years 8 months ago
2009
IEEE
Abstract— The paper investigates theoretical issues in applying the universal swarming technique to efficient content distribution. In a swarming session, a file is distributed...