Publisher
Springer International Publishing
Reference17 articles.
1. Du, D., Lu, R., Xu, D.: A primal-dual approximation algorithm for the facility location problem with submodular penalties. Algorithmica 63(1–2), 191–200 (2012)
2. Garey, M.R., Johnson, D.S.: Computers and intractability: a guide to the theory of NP-completeness. W.H Freeman and Company, New York (1990)
3. Galby, E., Marx, Dániel., Schepper, P., Sharma, R., Tale, P.: Parameterized complexity of weighted multicut in trees. arXiv:2205.10105 (2022) https://doi.org/10.48550/arXiv.2205.10105
4. Garg, N., Vazirani, V.V., Yannakakis, M.: Primal-dual approximation algorithms for integral flow and multicut in trees. Algorithmica 18, 3–20 (1997)
5. Guo, J., Liu, W., Hou, B.: An approximation algorithm for P-prize-collecting set cover problem. J. Oper. Res. Soc. China (2021) https://doi.org/10.1007/s40305-021-00364-7