1 citations · 1 across the 2 of their papers we have counts for
1 paper · 1 filter
Yusa Matsuda, Satoshi Takahashi
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 Ste…