Approximation algorithms for the k-depots Hamiltonian path problem
Crossref DOI link: https://doi.org/10.1007/s11590-021-01774-5
Published Online: 2021-06-30
Published Print: 2022-05
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Yang, Yichen
Liu, Zhaohui https://orcid.org/0000-0003-1215-7622
Yu, Wei
Funding for this research was provided by:
National Natural Science Foundation of China (11671135)
Natural Science Foundation of Shanghai (19ZR1411800)
Text and Data Mining valid from 2021-06-30
Version of Record valid from 2021-06-30
Article History
Received: 19 January 2019
Accepted: 17 June 2021
First Online: 30 June 2021