Publisher
Springer International Publishing
Reference19 articles.
1. Arkin, E.M., Hassin, R.: On local search for weighted $$k$$-set packing. Math. Oper. Res. 23(3), 640–648 (1998). https://doi.org/10.1287/moor.23.3.640
2. Lecture Notes in Computer Science;P Berman,2000
3. Berman, P., Fürer, M.: Approximating maximum independent set in bounded degree graphs. In: Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 365–371 (1994). https://dl.acm.org/doi/pdf/10.5555/314464.314570
4. Chandra, B., Halldórsson, M.M.: Greedy local improvement and weighted set packing approximation. J. Algorithms 39(2), 223–240 (2001). https://doi.org/10.1006/jagm.2000.1155
5. Cygan, M.: Improved approximation for 3-dimensional matching via bounded pathwidth local search. In: 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013, Berkeley, CA, USA, 26–29 October 2013, pp. 509–518. IEEE Computer Society (2013). https://doi.org/10.1109/FOCS.2013.61
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献