@article{Chandrasekaran2020TheMB,
title={The Maximum Binary Tree Problem},
author={K. Chandrasekaran and Elena Grigorescu and G. Istrate and S. Kulkarni and Young-San Lin and M. Zhu},
journal={ArXiv},
year={2020},
volume={abs/1909.07915}
}

We introduce and investigate the approximability of the maximum binary tree problem (MBT) in directed and undirected graphs. The goal in MBT is to find a maximum-sized binary tree in a given graph. MBT is a natural variant of the well-studied longest path problem, since both can be viewed as finding a maximum-sized tree of bounded degree in a given graph.
The connection to longest path motivates the study of MBT in directed acyclic graphs (DAGs), since the longest path problem is solvable… CONTINUE READING