186 search results - page 3 / 38 » Improved approximation algorithms for directed Steiner fores... |
COCOA
2008
Springer
13 years 11 months ago
2008
Springer
This paper deals with approximation algorithms for the prize collecting generalized Steiner forest problem, defined as follows. The input is an undirected graph G = (V, E), a colle...
ESA
2006
Springer
14 years 1 months ago
2006
Springer
COCOON
2005
Springer
14 years 3 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...
ALGORITHMICA
2005
13 years 9 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 10 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...