Abstract
The Max Tree Coverage (MTC) problem is the dual of the classic k-MST problem and has wide applications in areas such as network design and vehicle routing. Given a graph G with nonnegative costs defined on edges, a vertex \(r \in V(G)\), and a budget B, the rooted Max Tree Coverage problem asks to find a tree rooted at r having total cost at most B, so that the number of vertices included in the tree is maximized. This problem is NP-hard and has constant factor approximation algorithms. However, the existing approximation algorithms for rooted MTC is very complicated and hard to be implemented practically.
In this paper, we develop a simple CMSA heuristic for rooted MTC for the first time, where CMSA (Construct, Merge, Solve and Adapt) is a meta-heuristic proposed recently. We also formulate a polynomial size mixed integer linear program for rooted MTC for the first time. Experimental results show that CMSA has very good practical performance. For the small size instances of the problem, CMSA almost finds the optimal solutions. For the large size instances, CMSA finds solutions better than that of CPLEX within the same running time and two additional greedy algorithms. Note that within an admissible running time limit, CPLEX returns the best solutions ever found (not guarantee to be optimal).
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
Arora, S., Karakostas, G.: A \(2 + \epsilon \) approximation algorithm for the \(k\)-MST problem. In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 754–759 (2000)
Awerbuch, B., Azar, Y., Blum, A., Vempala, S.: Improved approximation guarantees for minimum-weight \(k\)-trees and prize-collecting salesmen. SIAM J. Copmput. 28(1), 254–262 (1998)
Bansal, N., Blum, A., Chawla, S., Meyerson, A.: Approximation algorithms for deadline-tsp and vehicle routing with time-windows. In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC), pp. 166–174 (2004)
Blesa, M.J., Xhafa, F.: A C++ implementation of tabu search for \(k\)-cardinality tree problem based on generic programming and component reuse. In: Proceedings of Net. ObjectDays Forum, pp. 648–652. Erfurt, Germany (2000)
Blum, A., Chawla, S., Karger, D.R., Lane, T., Meyerson, A., Minkoff, M.: Approximation algorithms for orienteering and discounted-reward TSP. SIAM J. Comput. 37(2), 653–670 (2007)
Blum, A., Ravi, R., Vempala, S.: A constant-factor approximation algorithm for the \(k\)-MST problem. In: Proceedings of the Annual ACM Symposium on Theory of Computing (STOC), pp. 442–448 (1996)
Blum, C., Pinacho, P., López-Ibáñez, M., Lozano, J.: Construct, merge, solve & adapt a new general algorithm for combinatorial optimization. Comput. Oper. Res. 68, 75–88 (2016)
Chaudhuri, K., Godfrey, B., Rao, S., Talwar, K.: Paths, trees, and minimum latency tours. In: Proceedings of the 44th IEEE Annual Symposium on Foundations of Computer Science (FOCS), pp. 36–45 (2003)
Chekuri, C., Korula, N., Pál, M.: Improved algorithms for orienteering and related problems. ACM Trans. Algorithms 8(3), 23:1–23:27 (2012)
Chekuri, C., Pal, M.: A recursive greedy algorithm for walks in directed graphs. In: Proceedings of the 46th annual IEEE Smposium on Foundations of Computer Science (FOCS), pp. 245–253 (2005)
Ehrgott, M., Freitag, J., Hamacher, H., Maffioli, F.: Heuristics for the \(k\)-cardinality tree and subgraph problems. Asia-Pacific J. Oper. Res. 14(1), 87–114 (1997)
Garg, N.: Saving an epsilon: a 2-approximation for the \(k\)-MST problem in graphs. In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC), pp. 302–309 (2005)
Johnson, D.S., Minkoff, M., Phillips, S.: The prize collecting steiner tree problem: theory and practice. In: Proceedings of the 11th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 760–769 (2000)
Lewis, R., Thiruvady, D., Morgan, K.: Finding happiness: an analysis of the maximum happy vertices problem. Comput. Oper. Res. 103, 265–276 (2019)
Pinacho-Davidson, P., Bouamama, S., Blum, C.: Application of CMSA to the minimum capacitated dominating set problem. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 321–328 (2019)
Ravi, R., Sundaram, R., Marathe, M.V., Rosenkrantz, D.J., Ravi, S.S.: Spanning trees short or small. SIAM J. Discret. Math. 9(2), 178–200 (1996)
Thiruvady, D., Lewis, R.: Recombinative approaches for the maximum happy vertices problem. Swarm Evolution. Comput. 75, 101188:1–101188:14 (2020)
Traub, V., Zenklusen, R.: A better-than-2 approximation for weighted tree augmentation. In: Proceedings of the 62th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2021), pp. 1–12 (2022)
Acknowledgements
This work is supported by the National Natural Science Foundation of China (62272280 and 61972228), and the Natural Science Foundation of Shandong Province (ZR2021ZD15).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Zhou, J., Zhang, P. (2024). Simple Heuristics for the Rooted Max Tree Coverage Problem. In: Wu, W., Guo, J. (eds) Combinatorial Optimization and Applications. COCOA 2023. Lecture Notes in Computer Science, vol 14461. Springer, Cham. https://doi.org/10.1007/978-3-031-49611-0_18
Download citation
DOI: https://doi.org/10.1007/978-3-031-49611-0_18
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-49610-3
Online ISBN: 978-3-031-49611-0
eBook Packages: Computer ScienceComputer Science (R0)