The Maximum Binary Tree Problem

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 generalization 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 efficiently in DAGs. In contrast, we show that MBT in DAGs is in fact hard: it has no efficient (-O(log n/ loglog n))-approximation algorithm under the exponential time hypothesis. In undirected graphs, we show that MBT has no efficient (-O(log^0.63n))-approximation under the exponential time hypothesis. Our hardness results rely on self-improving reductions and structural properties of binary trees. We also show constant-factor inapproximability assuming P≠NP. Furthermore, motivated by the longest heapable subsequence problem (introduced by Byers, Heeringa, Mitzenmacher, and Zervas, ANALCO '11), which is equivalent to MBT in permutation DAGs, we study MBT in restricted graph families. We show that MBT admits efficient algorithms in two graph families: bipartite permutation graphs and bounded treewidth graphs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/01/2021

Fixed-Parameter Algorithms for Longest Heapable Subsequence and Maximum Binary Tree

A heapable sequence is a sequence of numbers that can be arranged in a "...
research
12/04/2021

Algorithms for Maximum Internal Spanning Tree Problem for Some Graph Classes

For a given graph G, a maximum internal spanning tree of G is a spanning...
research
10/28/2019

Bounded Degree Group Steiner Tree Problems

We study two problems that seek a subtree T of a graph G=(V,E) such that...
research
12/16/2020

Maximum 0-1 Timed Matching on Temporal Graphs

Temporal graphs are graphs where the topology and/or other properties of...
research
07/24/2023

Tight Approximations for Graphical House Allocation

The Graphical House Allocation (GHA) problem asks: how can n houses (eac...
research
05/01/2018

Spectrally Robust Graph Isomorphism

We initiate the study of spectral generalizations of the graph isomorphi...
research
05/21/2018

A 5/2-Approximation Algorithm for Coloring Rooted Subtrees of a Degree 3 Tree

A rooted tree R⃗ is a rooted subtree of a tree T if the tree obtained by...

Please sign up or login with your details

Forgot password? Click here to reset