A local search algorithm for the k-path partition problem
-
Published:2023-02-27
Issue:1
Volume:18
Page:279-290
-
ISSN:1862-4472
-
Container-title:Optimization Letters
-
language:en
-
Short-container-title:Optim Lett
Author:
Li Shiming, Yu WeiORCID, Liu Zhaohui
Funder
National Natural Science Foundation of China Natural Science Foundation of Shanghai
Publisher
Springer Science and Business Media LLC
Subject
Control and Optimization,Business, Management and Accounting (miscellaneous)
Reference15 articles.
1. Chen, Y., Goebel, R., Lin, G., Su, B., Xu, Y., Zhang, A.: An improved approximation algorithm for the minimum 3-path partition problem. J. Comb. Optim. 38(1), 150–164 (2019) 2. Chen, Y., Goebel, R., Su, B., Tong, W., Xu, Y., Zhang, A.: A 21/16-approximation for the minimum 3-path partition problem. In: Proceedings of the 30th International Symposium on Algorithms and Computation (ISAAC 2019), vol. 149(46), pp. 1–20 (2019) 3. Chen, Y., Goebel, R., Lin, G., Liu, L., Su, B., Tong, W., Xu, Y., Zhang, A.: A local search 4/3-approximation algorithm for the minimum 3-path partition problem. In: Chen, Y., Deng, X., Lu, M. (eds.) Frontiers in Algorithmics. FAW 2019 Lecture Notes in Computer Science, vol. 11458, Springer, Cham, pp. 14–25 (2019) 4. Chen, Y., Chen, Z., Kennedy, C., Lin, G., Xu, Y., Zhang, A.: Approximation algorithms for the directed path partition problems. In: Chen, J., Li, M., Zhang, G. (eds.) Frontiers of Algorithmics. IJTCS-FAW 2021. Lecture Notes in Computer Science, vol. 12874, Springer, Cham (2022). https://doi.org/10.1007/978-3-030-97099-4_2 5. Duh, R., Furer, M.: 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 (1997)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
|
|