120 search results - page 2 / 24 » Improved Steiner tree approximation in graphs |
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 ...
DAC
2001
ACM
14 years 5 months ago
2001
ACM
This paper presents the concept of flexibility ? a geometric property associated with Steiner trees. Flexibility is related to the routability of the Steiner tree. We present an o...
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...
WADS
2007
Springer
13 years 11 months ago
2007
Springer
We present a polynomial-time approximation scheme (PTAS) for the Steiner tree problem with polygonal obstacles in the plane with running time O(n log2 n), where n denotes the numb...
NETWORKS
2006
13 years 4 months ago
2006
Abstract. The Steiner tree problem is to find a shortest subgraph that spans a given set of vertices in a graph. This problem is known to be NP-hard and it is well known that a pol...