Common Contracts
1 similar Maximum Agreement contracts
Maximum Agreement and Compatible SupertreesMaximum Agreement • April 12th, 2023
We then extend these problems to the case of supertrees where input trees can have non-identical leaf sets. For the obtained problems, SMAST and SMCT, we give an time algorithm for the special case of two input trees ( is the time bound for solving MAST, resp. MCT, on two -leaf trees). Finally, we show that SMAST and SMCT parametrized in are -hard and cannot be approximated in polynomial time within a constant factor unless , even when the input trees are rooted triples.
