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 scalable, commod- ity data center network architecture.ACM SIGCOMM Computer Communication Re- view, 38(4):63–74
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.