Better approximations for Tree Sparsity in Nearly-Linear Time
The Tree Sparsity problem is defined as follows: given a node-weighted tree of size n and an integer k, output a rooted subtree of size k with maximum weight. The best known algorithm solves this problem in time O(kn), i.e., quadratic in the size of the input tree for k = Θ(n). In this work, we desi...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
Society for Industrial and Applied Mathematics (SIAM),
2017-10-23T15:26:22Z.
|
| Subjects: | |
| Online Access: | Get fulltext |