Skip to main content
Springer Nature Link
Log in

Approximating the Spanning k-Tree Forest Problem

  • Conference paper
Frontiers in Algorithmics (FAW 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5598))

Included in the following conference series:

Abstract

As a generalization of the spanning star forest problem, the spanning k-tree forest problem is to find a maximum-edge-weight spanning forest in which each tree has a central node and other nodes in the tree are at most k-distance away from the central node. In this paper, we show that it can be approximated with ratio \(\frac{k}{k+1}\) in polynomial time for both undirected and directed graphs. In the weighted distance model, a 0.5-approximation algorithm is presented.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Bock, F.: An algorithm to construct a minimum directed spanning tree in a directed network. In: Developments in Operations Research, pp. 29–44. Gordon and Breach, New York (1971)

    Google Scholar 

  2. Camerini, P.M., Fratta, L., Maffioli, F.: A note on finding optimum branchings. Networks 9, 309–312 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  3. Chakrabarty, D., Goel, G.: On the Approximability of Budgeted Allocations and Improved Lower Bounds for Submodular Welfare Maximization and GAP. In: Proceedings of the 49th IEEE Symposium on Foundations of Computer Science, FOCS 2008, pp. 687–696 (2008)

    Google Scholar 

  4. Chang, G.J.: Labeling algorithms for domination problems in sun-free chordal graphs. Discrete Appl. Math. 22, 21–34 (1988/1989)

    Google Scholar 

  5. 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.) RANDOM 2007 and APPROX 2007. LNCS, vol. 4627, pp. 44–58. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  6. Cockayne, E.J., Goodman, S.E., Hedetniemi, S.T.: A linear algorithm for the domination number of a tree. Inform. Process. Lett. 4, 41–44 (1975)

    Article  MATH  Google Scholar 

  7. Chu, Y.J., Liu, T.H.: On the shortest arborescence of a directed graph. Science Sinica 14, 1396–1400 (1965)

    MathSciNet  MATH  Google Scholar 

  8. Edmonds, J.: Optimum branchings. J. Research of the National Bureau of Standards 71B, 233–240 (1967)

    Article  MathSciNet  MATH  Google Scholar 

  9. Håstad, J.: Some optimal inapproximability results. J. ACM 48, 798–859 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  10. Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Domination in Graphs: Advanced Topics. Marcel Dekker, Inc., New York (1998)

    MATH  Google Scholar 

  11. Henning, M.A., Oellermann, O.R., Swart, H.C.: Bounds on distance domination parameters. J. Combin. Inform. System. Sci. 16, 11–18 (1991)

    MathSciNet  MATH  Google Scholar 

  12. Henning, M.A., Oellermann, O.R., Swart, H.C.: The diversity of domination. Discrete Math. 161, 161–173 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  13. Hochbaum, D.S., Maass, W.: Approximation schemes for covering and packing problems in image processing and VLSI. J. ACM 32, 130–136 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  14. Karp, R.M.: A simple derivation of edmonds’ algorithm for optimum branchings. Networks 1, 265–272 (1971)

    Article  MathSciNet  MATH  Google Scholar 

  15. Liao, C.S., Chang, G.J.: k-tuple domination in graphs. Inform. Process. Lett. 87, 45–50 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  16. 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 J. Comput. 38, 946–962 (2008); also appeared in Proc. of SODA 2007, pp. 645–654 (2007)

    Google Scholar 

  17. Tarjan, R.E.: Finding optimum branchings. Networks 7, 25–35 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  18. Slater, P.J.: R-Domination in Graphs. J. ACM 23, 446–450 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  19. Yannakakis, M., Gavril, F.: Edge dominating sets in graphs. SIAM J. Appl. Math. 38, 364–372 (1980)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Information Engineering, National Taiwan University, Taiwan

    Chung-Shou Liao

  2. Department of Mathematics, National University of Singapore, Singapore

    Louxin Zhang

Authors
  1. Chung-Shou Liao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Louxin Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science,, City University of Hong Kong, No. 83 Tat Chee Avenue, Kowloon Tong, Hong Kong, China

    Xiaotie Deng

  2. Computer Science Department, Cornell University, 5144 Upson Hall, NY 14853, Ithaca, USA

    John E. Hopcroft

  3. Provincial Key Laboratory of High-Performance Computing, Jiangxi Normal University, 330027, Nanchang, China

    Jinyun Xue

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Liao, CS., Zhang, L. (2009). Approximating the Spanning k-Tree Forest Problem. In: Deng, X., Hopcroft, J.E., Xue, J. (eds) Frontiers in Algorithmics. FAW 2009. Lecture Notes in Computer Science, vol 5598. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02270-8_30

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02270-8_30

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02269-2

  • Online ISBN: 978-3-642-02270-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics