Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

A two-level meta-heuristic approach for the minimum dominating tree problem

  • Letter
  • Published:
Frontiers of Computer Science Aims and scope Submit manuscript

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. Zhang N, Shin I, Li B, Boyaci C, Tiwari R, Thai M T. New approximation for minimum-weight routing backbone in wireless sensor network. In: Proceedings of the 3rd International Conference on Wireless Algorithms, Systems, and Applications. 2008

  2. Shin I, Shen Y, Thai M T. On approximation of dominating tree in wireless sensor networks. Optimization Letters, 2010, 4(3): 393–403

    Article  MathSciNet  Google Scholar 

  3. Sundar S, Singh A. New heuristic approaches for the dominating tree problem. Applied Soft Computing, 2013, 13(12): 4695–4703

    Article  Google Scholar 

  4. Chaurasia S N, Singh A. A hybrid heuristic for dominating tree problem. Soft Computing, 2016, 20(1): 377–397

    Article  Google Scholar 

  5. Dražic Z, Čangalović M, Kovačević-Vujčić V. A metaheuristic approach to the dominating tree problem. Optimization Letters, 2017, 11(6): 1155–1167

    Article  MathSciNet  Google Scholar 

  6. Singh K, Sundar S. Two new heuristics for the dominating tree problem. Applied Intelligence, 2018, 48(8): 2247–2267

    Article  Google Scholar 

  7. Hu S, Liu H, Wu X, Li R, Zhou J, Wang J. A hybrid framework combining genetic algorithm with iterated local search for the dominating tree problem. Mathematics, 2019, 7(4): 359

    Article  Google Scholar 

  8. Wu X, Lü Z, Galinier P. Restricted swap-based neighborhood search for the minimum connected dominating set problem. Networks, 2017, 69(2): 222–236

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

The research was supported by the National Natural Science Foundation of China (Grant Nos. 61902116, 62002105, 62201203) and the Science and Technology Research Program of Hubei Province (2021BLB171).

Author information

Authors and Affiliations

  1. School of Computer Science, Hubei University of Technology, Wuhan, 430068, China

    Caiquan Xiong, Hang Liu, Xinyun Wu & Na Deng

Authors
  1. Caiquan Xiong
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hang Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Xinyun Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Na Deng
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xinyun Wu.

Additional information

Supporting information The supporting information is available online at https://journal.hep.com.cn and https://link.springer.com.

Electronic supplementary material

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Xiong, C., Liu, H., Wu, X. et al. A two-level meta-heuristic approach for the minimum dominating tree problem. Front. Comput. Sci. 17, 171406 (2023). https://doi.org/10.1007/s11704-022-2178-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s11704-022-2178-2

Search

Navigation