632 search results - page 5 / 127 » On the Approximability of the Steiner Tree Problem |
ISAAC
2004
Springer
14 years 27 days 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...
COCOA
2008
Springer
13 years 9 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...
WG
2001
Springer
13 years 12 months ago
2001
Springer
ISAAC
1993
Springer
13 years 11 months ago
1993
Springer
CIAC
2006
Springer
13 years 11 months ago
2006
Springer