402 search results - page 50 / 81 » A branch and cut algorithm for the Steiner problem in graphs |
GI
2007
Springer
14 years 1 months ago
2007
Springer
: Several algorithms are common for estimating depth from stereo series, but many of them have difficulties when determining depth of objects having periodical structure. This con...
SAC
2009
ACM
14 years 2 months ago
2009
ACM
The molecular distance geometry problem can be formulated as the problem of finding an immersion in R3 of a given undirected, nonnegatively weighted graph G. In this paper, we di...
ICALP
2005
Springer
14 years 27 days ago
2005
Springer
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
COCOON
2008
Springer
13 years 9 months ago
2008
Springer
In this paper, we introduce the generalized capacitated tree-routing problem (GCTR), which is described as follows. Given a connected graph G = (V, E) with a sink s V and a set M...
IWPEC
2009
Springer
14 years 1 months ago
2009
Springer
We describe a framework for expressing the complexity of algorithms for FPT problems with two separate parameters k, m and with exponential time bounds O∗ (xk ym ) where x, y &g...