Designing Approximate Binary Trees for Trees
Data Structures and Algorithms
2026-04-23 v1
Abstract
We study the following problem that is motivated by demand-aware network design: Given a tree~, the task is to find a binary tree~ on the same vertex set. The objective is to minimize the sum of distances in~ between vertex pairs that are adjacent in~. We present a linear-time factor-4 approximation for this problem.
Cite
@article{arxiv.2604.20786,
title = {Designing Approximate Binary Trees for Trees},
author = {Leon Kellerhals and Mitja Krebs and André Nichterlein and Stefan Schmid},
journal= {arXiv preprint arXiv:2604.20786},
year = {2026}
}