An Improved Approximation Algorithm for Spanning Star Forest in Dense Graphs

  • Jing He
  • Hongyu Liang
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6509)

Abstract

A spanning subgraph of a given graph G is called a spanning star forest of G if it is a collection of node-disjoint trees of depth at most 1 (such trees are called stars). The size of a spanning star forest is the number of leaves in all its components. The goal of the spanning star forest problem [12] is to find the maximum-size spanning star forest of a given graph.

In this paper, we study this problem in c-dense graphs, where for c ∈ (0,1), a graph of n vertices is called c-dense if it contains at least cn2/2 edges [2]. We design a \((\alpha+(1-\alpha)\sqrt{c}-\epsilon)\)-approximation algorithm for spanning star forest in c-dense graphs for any ε> 0, where \(\alpha=\frac{193}{240}\) is the best known approximation ratio of the spanning star forest problem in general graphs [3]. Thus, our approximation ratio outperforms the best known bound for this problem when dealing with c-dense graphs. We also prove that for any c ∈ (0,1), there is a constant ε = ε(c) > 0 such that approximating spanning star forest in c-dense graphs within a factor of 1 − ε is NP-hard. We then demonstrate that for weighted versions (both node- and edge- weighted) of this problem, we cannot get any approximation algorithm with strictly better performance guarantee in c-dense graphs than that of the best possible approximation algorithm for general graphs. Finally, we give strong hardness-of-approximation results for a closely related problem, the minimum dominating set problem, in c-dense graphs.

Keywords

spanning star forest approximation algorithm dense graphs 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Agra, A., Cardoso, D., Cerfeira, O., Rocha, E.: A spanning star forest model for the diversity problem in automobile industry. In: Proc. of ECCO XVII (2005)Google Scholar
  2. 2.
    Arora, S., Karger, D., Karpinski, M.: Polynomial time approximation schemes for dense instances of NP-hard problems. Journal of Computer and System Sciences 58(1), 193–210 (1999)MATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Athanassopoulos, S., Caragiannis, I., Kaklamanis, C., Kuropoulou, M.: An improved approximation bound for spanning star forest and color saving. In: Královič, R., Niwiński, D. (eds.) MFCS 2009. LNCS, vol. 5734, pp. 90–101. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  4. 4.
    Berry, V., Guillemot, S., Nicholas, F., Paul, C.: On the approximation of computing evolutionary trees. In: Wang, L. (ed.) COCOON 2005. LNCS, vol. 3595, pp. 115–125. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  5. 5.
    Cardinal, J., Langerman, S., Levy, E.: Improved approximation bounds for edge dominating set in dense graphs. Theoretical Computer Science 410, 949–957 (2009)MATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Chakrabarty, D., Goel, G.: On the approximability of budgeted allocations and improved lower bounds for submodular welfare maximization and GAP. In: Proc. of FOCS 2008, pp. 687–696 (2008)Google Scholar
  7. 7.
    Chen, N., Engelberg, R., Nguyen, C.T., Raghavendra, P., Rudra, A., Singh, G.: Improved approximation algorithms for the spanning star forest problem. In: Charikar, M., Jansen, K., Reingold, O., Rolim, J.D.P. (eds.) APPROX 2007. LNCS, vol. 4627, pp. 44–58. Springer, Heidelberg (2007)Google Scholar
  8. 8.
    Duh, R., Furer, M.: Approximation of k-set cover by semi local optimization. In: Proc. of STOC 1997, pp. 256–264 (1997)Google Scholar
  9. 9.
    Feige, U.: A threshold of lnn for aproximating set cover. Journal of the ACM 45(4), 634–652 (1998)MATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Gaspers, S., Kratsch, D., Liedloff, M., Todinca, I.: Exponential time algorithms for the minimum dominating set problem on some graph classes. ACM Transactions on Algorithms 6(1), No. 9 (2009)Google Scholar
  11. 11.
    Imamura, T., Iwama, K.: Approximating vertex cover on dense graphs. In: Proc. of SODA 2005, pp. 582–589 (2005)Google Scholar
  12. 12.
    Nguyen, C.T., Shen, J., Hou, M., Sheng, L., Miller, W., Zhang, L.: Approximating the spanning star forest problem and its applications to genomic sequence alignment. SIAM Journal on Computing 38(3), 946–962 (2008)MATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    Raz, R., Safra, S.: A sub-constant error-probability low-degree test, and sub-constant error-probability PCP characterization of NP. In: Proc. of STOC 1997, pp. 475–484 (1997)Google Scholar
  14. 14.
    Schiermeyer, I.: Problems remaining NP-complete for sparse or dense graphs. Discuss. Math. Graph. Theory 15, 33–41 (1995)MATHMathSciNetGoogle Scholar
  15. 15.
    Vazirani, V.: Approximation Algorithms. Springer, Heidelberg (2001)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Jing He
    • 1
  • Hongyu Liang
    • 1
  1. 1.Institute for Theoretical Computer ScienceTsinghua UniversityBeijingChina

Personalised recommendations