Designing Approximate Binary Trees for Trees
Abstract
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 minimize the sum of distances in~H between vertex pairs that are adjacent in~G. We present a linear-time factor-4 approximation for this problem.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.