447 search results - page 2 / 90 » Approximation Algorithms for Directed Steiner Problems |
116
click to vote
ISAAC
2004
Springer
15 years 6 months ago
2004
Springer
The Steiner tree problem asks for a minimum cost tree spanning a given set of terminals S ⊆ V in a weighted graph G = (V, E, c), c : E → R+ . In this paper we consider a genera...
107
click to vote
COR
2007
15 years 1 months ago
2007
We present new primal-dual algorithms for several network design problems. The problems considered are the generalized Steiner tree problem (GST), the directed Steiner tree proble...
103
click to vote
COCOON
2005
Springer
15 years 6 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...
120
click to vote
ALGORITHMICA
2005
15 years 1 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 ...
CCCG
2007
15 years 2 months ago
2007
We introduce bundle-free triangulations, that are free of large collection of triangles overlapping a circle empty of vertices. We prove that bundle-free Steiner triangulations ca...