Highly Influenced

# Improved Approximation Algorithms for the Spanning Star Forest Problem

@article{Chen2007ImprovedAA, title={Improved Approximation Algorithms for the Spanning Star Forest Problem}, author={Ning Chen and Roee Engelberg and C. Thach Nguyen and Prasad Raghavendra and Atri Rudra and Gyanit Singh}, journal={Algorithmica}, year={2007}, volume={65}, pages={498-516} }

- Published 2007 in Algorithmica
DOI:10.1007/s00453-011-9607-1

A star graph is a tree of diameter at most two. A star forest is a graph that consists of node-disjoint star graphs. In the spanning star forest problem, given an unweighted graph G, the objective is to find a star forest that contains all vertices of G and has the maximum number of edges. This problem is the complement of the dominating set problem in the following sense: On a graph with n vertices, the size of the maximum spanning star forest is equal to n minus the size of the minimum… CONTINUE READING

#### From This Paper

##### Figures, tables, and topics from this paper.

16 Citations

16 References

Similar Papers