The Maximum Binary Tree Problem

@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}
}
  • K. Chandrasekaran, Elena Grigorescu, +3 authors M. Zhu
  • Published 2020
  • Mathematics, Computer Science
  • ArXiv
  • 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
    1 Citations
    On the heapability of finite partial orders
    • 1
    • PDF

    References

    SHOWING 1-10 OF 42 REFERENCES
    On approximating the longest path in a graph
    • 194
    • Highly Influential
    • PDF
    Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem
    • 18
    • PDF
    What Would Edmonds Do? Augmenting Paths and Witnesses for Degree-Bounded MSTs
    • 23
    • PDF
    Faster Algebraic Algorithms for Path and Packing Problems
    • I. Koutis
    • Mathematics, Computer Science
    • ICALP
    • 2008
    • 182
    • Highly Influential
    • PDF
    A push-relabel approximation algorithm for approximating the minimum-degree MST problem and its generalization to matroids
    • 15
    • PDF
    Approximating the Minimum-Degree Steiner Tree to within One of Optimal
    • 203
    Narrow sieves for parameterized paths and packings
    • 92
    • PDF
    Minimum Bounded Degree Spanning Trees
    • M. Goemans
    • Mathematics, Computer Science
    • 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06)
    • 2006
    • 159
    • PDF
    Degree-Constrained Subgraph Problems: Hardness and Approximation Results
    • 32
    • Highly Influential
    • PDF
    Improved Inapproximability Results for Maximum k-Colorable Subgraph
    • 13
    • Highly Influential
    • PDF