522 search results - page 36 / 105 » The 3-Steiner Root Problem |
CPM
2004
Springer
14 years 2 months ago
2004
Springer
For a set of rooted, unordered, distinctly leaf-labeled trees, the NP-hard maximum agreement subtree problem (MAST) asks for a tree contained (up to isomorphism or homeomorphism) i...
IPCO
2010
13 years 10 months ago
2010
In a column-restricted covering integer program (CCIP), all the non-zero entries of any column of the constraint matrix are equal. Such programs capture capacitated versions of cov...
RECOMB
2008
Springer
14 years 9 months ago
2008
Springer
We introduce the first exact and efficient algorithm for Guig?o et al.'s problem that, given a collection of rooted, binary gene trees and a rooted, binary species tree, deter...
ICALP
2011
Springer
13 years 4 days ago
2011
Springer
We consider the following Tree-Constrained Bipartite Matching problem: Given two rooted trees T1 = (V1, E1), T2 = (V2, E2) and a weight function w : V1 × V2 → R+, find a maximu...
CONPAR
1992
14 years 23 days ago
1992
The algorithm designed in [12, 15] was the very first distributed algorithm to solve the mutual exclusion problem in complete networks by using a dynamic logical tree structure as...