Designing Approximate Binary Trees for Trees

Leon Kellerhals, Mitja Krebs, André Nichterlein +1

We study the following problem that is motivated by demand-aware network design: Given a tree~$G$, the task is to find a binary tree~$H$ on the same vertex set. The objective is to…