Abstract
A spanning subgraph of a graph G is called a spanning star forest of G if it is a collection of node-disjoint trees of depth at most 1. The size of a spanning star forest is the number of leaves in all its components. The goal of the spanning star forest problem is to find the maximum-size spanning star forest of a given graph.
In this paper, we study the spanning star forest problem on c-dense graphs, where for any fixed c∈(0,1), a graph of n vertices is called c-dense if it contains at least cn 2/2 edges. 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. Thus, our approximation ratio outperforms the best known bound for this problem when dealing with c-dense graphs. We also prove that, for any constant c∈(0,1), approximating spanning star forest in c-dense graphs is APX-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 on c-dense graphs than on general graphs. Finally, we give strong inapproximability results for a closely related problem, namely the minimum dominating set problem, restricted on c-dense graphs.
Similar content being viewed by others
References
Agra A, Cardoso D, Cerfeira O, Rocha E (2005) A spanning star forest model for the diversity problem in automobile industry. In: Proceedings of the 17th European conference on combinatorial optimization (ECCO), p XVII
Arora S, Karger D, Karpinski M (1999) Polynomial time approximation schemes for dense instances of NP-hard problems. J Comput Syst Sci 58(1):193–210
Athanassopoulos S, Caragiannis I, Kaklamanis C, Kuropoulou M (2009) An improved approximation bound for spanning star forest and color saving. In: 34th international symposium on mathematical foundations of computer science (MFCS). LNCS, vol 5734, pp 90–101
Berry V, Guillemot S, Nicholas F, Paul C (2005) On the approximation of computing evolutionary trees. In: 11th international computing and combinatorics conference (COCOON). LNCS, vol 3595, pp 115–125
Cardinal J, Langerman S, Levy E (2009) Improved approximation bounds for edge dominating set in dense graphs. Theor Comput Sci 410:949–957
Cardinal J, Karpinski M, Schmied R, Viehmann C (2010) Approximating subdense instances of covering problems. arXiv:1011.0078v2
Chakrabarty D, Goel G (2008) On the approximability of budgeted allocations and improved lower bounds for submodular welfare maximization and gap. In: Proceedings of 49th annual IEEE symposium on foundations of computer science (FOCS), pp 687–696
Chen N, Engelberg R, Nguyen CT, Raghavendra P, Rudra A, Singh G (2007) Improved approximation algorithms for the spanning star forest problem. In: 10th intl workshop on approximation algorithms for combinatorial optimization problems (APPROX). LNCS, vol 4627, pp 44–58
Duh R, Furer M (1997) Approximation of k-set cover by semi local optimization. In: Proceedings of the 29th annual ACM symposium on the theory of computing (STOC), pp 256–264
Feige U (1998) A threshold of lnn for approximating set cover. J ACM 45(4):634–652
Gaspers S, Kratsch D, Liedloff M, Todinca I (2009) Exponential time algorithms for the minimum dominating set problem on some graph classes. ACM Trans Algorithms 6(1)
Imamura T, Iwama K (2005) Approximating vertex cover on dense graphs. In: Proceedings of the 16th annual ACM-SIAM symposium on discrete algorithms (SODA), pp 582–589
Nguyen CT, Shen J, Hou M, Sheng L, Miller W, Zhang L (2008) Approximating the spanning star forest problem and its applications to genomic sequence alignment. SIAM J Comput 38(3):946–962
Raz R, Safra S (1997) A sub-constant error-probability low-degree test, and sub-constant error-probability PCP characterization of NP. In: Proceedings of the 29th annual ACM symposium on the theory of computing (STOC), pp 475–484
Schiermeyer I (1995) Problems remaining NP-complete for sparse or dense graphs. Discuss Math Graph Theory 15:33–41
Vazirani V (2001) Approximation algorithms. Springer, Berlin
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was supported in part by the National Basic Research Program of China Grant 2011CBA00300, 2011CBA00301, and the National Natural Science Foundation of China Grant 61033001, 61061130540, 61073174. Part of this work was done while the authors were visiting Cornell University.
Rights and permissions
About this article
Cite this article
He, J., Liang, H. Improved approximation for spanning star forest in dense graphs. J Comb Optim 25, 255–264 (2013). https://doi.org/10.1007/s10878-012-9499-2
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-012-9499-2