A 4-Approximation Algorithm for k-Prize Collecting Steiner Tree Problems
Computational Complexity
2018-02-20 v1 Discrete Mathematics
Optimization and Control
Abstract
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.
Cite
@article{arxiv.1802.06564,
title = {A 4-Approximation Algorithm for k-Prize Collecting Steiner Tree Problems},
author = {Yusa Matsuda and Satoshi Takahashi},
journal= {arXiv preprint arXiv:1802.06564},
year = {2018}
}
Comments
This article is under reviewing