A 4-approximation algorithm for k-prize collecting Steiner tree problems
- 47 Downloads
This paper studies a 4-approximation algorithm for k-prize collecting Steiner tree problems. This problem generalizes both k-minimum spanning tree problems and prize collecting Steiner tree problems. Our proposed algorithm employs two 2-approximation algorithms for k-minimum spanning tree problems and prize collecting Steiner tree problems. Also our algorithm framework can be applied to a special case of k-prize collecting traveling salesman problems.
KeywordsApproximation algorithm Primal-dual algorithm k-prize collecting Steiner tree problems k-prize collecting traveling salesman problems
We thank one anonymous reviewer for very valuable feedback. This research was partially supported by the Ministry of Education, Science, Sports and Culture through Grants-in-Aid for Scientific Research (C) 26330025, (B) 15H02972, and through Grants-in-Aid for Young Scientists (B) 26870200.
- 2.Han, L., Xu, D., Du, D., Wu, C.: A 5-approximation algorithm for the k-prize-collecting Steiner tree problem. Optim. Lett. (2017). https://doi.org/10.1007/s11590-017-1135-8
- 5.Garg, N.: A 3-approximation for the minimum tree spanning \(k\) vertices. In: Proceedings of 37th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 302–309 (1996)Google Scholar
- 10.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, pp. 396–402 (2005)Google Scholar
- 11.Ausiello, G., Bonifaci, V., Leonardi, S., Spaccamela, A.M.: Prize collecting traveling salesman problem and related problems. In: Handbook of Approximation Algorithms and Metaheuristics, Chapter 40. Chapman & Hall/CRC (2007)Google Scholar