106 search results - page 5 / 22 » On the Approximability of the Steiner Tree Problem in Phylog... |
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...
ICDE
2009
IEEE
14 years 9 months ago
2009
IEEE
A common approach to performing keyword search over relational databases is to find the minimum Steiner trees in database graphs. These methods, however, are rather expensive as th...
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