Handbook of theoretical computer science (vol. A): algorithms and complexity
Handbook of theoretical computer science (vol. A): algorithms and complexity
Approximating maximum leaf spanning trees in almost linear time
Journal of Algorithms
On Approximating the Longest Path in a Graph (Preliminary Version)
WADS '93 Proceedings of the Third Workshop on Algorithms and Data Structures
The Power of Local Optimizations: Approximation Algorithms for Maximun-leaf Spanning Tree (DRAFT)*
The Power of Local Optimizations: Approximation Algorithms for Maximun-leaf Spanning Tree (DRAFT)*
Approximation algorithms for the maximum internal spanning tree problem
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Better Approximation Algorithms for the Maximum Internal Spanning Tree Problem
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Approximating the Maximum Internal Spanning Tree problem
Theoretical Computer Science
Paired approximation problems and incompatible inapproximabilities
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Note: On spanning cycles, paths and trees
Discrete Applied Mathematics
| Hi-index | 0.89 |
The problem of finding a spanning tree with few leaves is motivated by the design of communication networks, where the cost of the devices depends on their routing functionality (ending, forwarding, or routing a connection). Besides this application, the problem has its own theoretical importance as a generalization of the Hamiltonian path problem. Lu and Ravi showed that there is no constant factor approximation for minimizing the number of leaves of a spanning tree, unless P=NP. Thus instead of minimizing the number of leaves, we are going to deal with maximizing the number of non-leaves: we give a linear-time 2-approximation for arbitrary graphs, a 32-approximation for claw-free graphs, and a 65-approximation for cubic graphs.