Publisher
Springer Nature Singapore
Reference32 articles.
1. Arkin, E.M., Hassin, R.: On local search for weighted k-set packing. Math. Oper. Res. 23(3), 640–648 (1998)
2. Bar-Noy, A., Peleg, D., Rabanca, G., Vigan, I.: Improved approximation algorithms for weighted 2-path partitions. Discret. Appl. Math. 239, 15–37 (2018)
3. Berman, P.: A d/2 approximation for maximum weight independent set in d-claw free graphs. Nord. J. Comput. 7(3), 178–184 (2000)
4. Berman, P., Karpinski, M.: 8/7-approximation algorithm for (1, 2)-TSP. In: SODA 2006, pp. 641–648. ACM Press (2006)
5. Chen, Y., Chen, Z., Lin, G., Wang, L., Zhang, A.: A randomized approximation algorithm for metric triangle packing. J. Comb. Optim. 41(1), 12–27 (2021)