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}
}
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
16 Citations
16 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 16 references

A spanning star forest model for the diversity problem in automobile industry

  • A. Agra, D. Cardoso, O. Cerfeira, E. Rocha
  • In ECCO XVIII,
  • 2005
1 Excerpt

On the approximation of computing evolutionary trees

  • V. Berry, S. Guillemot, F. Nicholas, C. Paul
  • In Proceedings of the Eleventh Annual…
  • 2005
1 Excerpt

Similar Papers

Loading similar papers…