Sciweavers

Share
33 search results - page 2 / 7
» Improved Approximation Algorithms for PRIZE-COLLECTING STEIN...
Sort
View
SODA
2001
ACM
150views Algorithms» more  SODA 2001»
9 years 6 months ago
A faster implementation of the Goemans-Williamson clustering algorithm
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...
Richard Cole, Ramesh Hariharan, Moshe Lewenstein, ...
ESA
2003
Springer
189views Algorithms» more  ESA 2003»
9 years 10 months ago
On the Complexity of Approximating TSP with Neighborhoods and Related Problems
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 ...
Shmuel Safra, Oded Schwartz
STOC
2005
ACM
89views Algorithms» more  STOC 2005»
10 years 5 months ago
Universal approximations for TSP, Steiner tree, and set cover
Lujun Jia, Guolong Lin, Guevara Noubir, Rajmohan R...
ALGORITHMICA
2005
99views more  ALGORITHMICA 2005»
9 years 5 months ago
Improved Approximation Algorithms for the Quality of Service Multicast Tree Problem
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 ...
Marek Karpinski, Ion I. Mandoiu, Alexander Olshevs...
COCOON
2005
Springer
9 years 11 months ago
Algorithms for Terminal Steiner Trees
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...
Fábio Viduani Martinez, José Coelho ...
books