33 search results - page 2 / 7 » Improved Approximation Algorithms for PRIZE-COLLECTING STEIN... |
SODA
2001
ACM
13 years 6 months ago
2001
ACM
We give an implementation of the Goemans-Williamson clustering procedure which is at the core of several approximation algorithms including those for Generalized Steiner Trees, Pr...
ESA
2003
Springer
13 years 9 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 ...
STOC
2005
ACM
14 years 4 months ago
2005
ACM
ALGORITHMICA
2005
13 years 4 months ago
2005
Abstract. The Quality of Service Multicast Tree Problem is a generalization of the Steiner tree problem which appears in the context of multimedia multicast and network design. In ...
COCOON
2005
Springer
13 years 10 months ago
2005
Springer
The terminal Steiner tree problem (TST) consists of finding a minimum cost Steiner tree where each terminal is a leaf. We describe a factor 2ρ−ρ/(3ρ−2) approximation algor...