Article thumbnail

Max-Leaves Spanning Tree is APX-hard for Cubic Graphs

By Paul Bonsma

Abstract

We consider the problem of finding a spanning tree with maximum number of leaves (MaxLeaf). A 2-approximation algorithm is known for this problem, and a 3/2-approximation algorithm when restricted to graphs where every vertex has degree 3 (cubic graphs). MaxLeaf is known to be APX-hard in general, and NP-hard for cubic graphs. We show that the problem is also APX-hard for cubic graphs. The APX-hardness of the related problem Minimum Connected Dominating Set for cubic graphs follows

Topics: Computer Science - Discrete Mathematics, Computer Science - Computational Complexity, Computer Science - Data Structures and Algorithms
Year: 2009
OAI identifier: oai:arXiv.org:0912.0226

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.

Suggested articles