Funder
Natural Sciences and Engineering Research Council of Canada
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications
Reference15 articles.
1. Chen Y, Goebel R, Lin G, Liu L, Su B, Tong W, Xu Y, Zhang A (2019a) A local search 4/3-approximation algorithm for the minimum 3-path partition problem. In: Proceedings of FAW 2019, LNCS, vol 11458, pp 14–25
2. Chen Y, Goebel R, Lin G, Su B, Xu Y, Zhang A (2019b) An improved approximation algorithm for the minimum 3-path partition problem. J Comb Optim 38:150–164
3. Chen Y, Goebel R, Su B, Tong W, Xu Y, Zhang A (2019c) A 21/16-approximation for the minimum 3-path partition problem. In: Proceedings of ISAAC 2019, LIPIcs, vol 149, pp 46:1–46:20
4. Duh R, Fürer M (1997) Approximation of k-set cover by semi-local optimization. In: Proceedings of the twenty-ninth annual ACM symposium on theory of computing, STOC’97, pp 256–264
5. Feige U (1998) A threshold of for approximating set cover. J ACM 45:634–652
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献