A linear-time 4-approximation algorithm for finding a binary tree that minimizes the sum of distances between adjacent vertices in a given tree.
A survey of graph layout problems.ACM Computing Surveys (CSUR), 34(3):313–356, 2002
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Designing Approximate Binary Trees for Trees
A linear-time 4-approximation algorithm for finding a binary tree that minimizes the sum of distances between adjacent vertices in a given tree.