Abstract
The problem under consideration is called the minimum cost dominating tree problem [6]. It arises in the context of wireless mobile communication, when building a virtual backbone is required.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Adasme, P., Andrade, R., Lisser, A.: Minimum cost dominating tree sensor networks under probabilistic constraints. Comput. Netw. 112, 208–222 (2017)
Cheriyan, J., Ravi, R.: Lecture notes on approximation algorithms for network problems (1998). http://www.math.uwaterloo.ca/jcheriya/lecnotes.html
Méndez-Díaz, I., Zabala, P.: A cutting plane algorithm for graph coloring. Discret. Appl. Math. 156, 159–179 (2008)
Magnanti, T.L., Wolsey, L.A.: Optimal trees. In: Ball, M., Magnanti, M.L., Monma, C.L., Nemhauser, G.L. (eds.) Network Models. Handbooks in Operations Research and Management Science, vol. 7, pp. 503–615. North-Holland, Amsterdam (1995)
Puchinger, J., Raidl, G.R., Pirkwieser, S.: MetaBoosting: enhancing integer programming techniques by metaheuristics. In: Maniezzo, V., Stützle, T., Voß, S. (eds.) Matheuristics: Hybridizing Metaheuristics and Mathematical Programming. AOIS, vol. 10, pp. 71–102. Springer, Boston (2010). https://doi.org/10.1007/978-1-4419-1306-7_3
Schin, I., Shen, Y., Thai, M.: On approximation of dominating tree in wireless sensor networks. Optim. Lett. 4, 393–403 (2010)
Sundar, S., Singh, A.: New heuristic approaches for the dominating tree problem. Appl. Soft Comput. 13, 4695–4703 (2013)
Wolsey, L.: Integer Programming. Wiley, New York (1998)
Chaurasia, S.N., Singh, A.: A hybrid heuristic for dominating tree problem. Soft Comput. 20, 377–397 (2016)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG
About this paper
Cite this paper
Rossi, A., Singh, A., Sundar, S. (2018). Properties and Exact Solution Approaches for the Minimum Cost Dominating Tree Problem. In: Negi, A., Bhatnagar, R., Parida, L. (eds) Distributed Computing and Internet Technology. ICDCIT 2018. Lecture Notes in Computer Science(), vol 10722. Springer, Cham. https://doi.org/10.1007/978-3-319-72344-0_1
Download citation
DOI: https://doi.org/10.1007/978-3-319-72344-0_1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-72343-3
Online ISBN: 978-3-319-72344-0
eBook Packages: Computer ScienceComputer Science (R0)