A fast $$(2 + \frac{2}{7})$$-approximation algorithm for capacitated cycle covering
Crossref DOI link: https://doi.org/10.1007/s10107-021-01678-3
Published Online: 2021-06-29
Published Print: 2022-03
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Traub, Vera
Tröbst, Thorben http://orcid.org/0000-0003-3350-7337
Funding for this research was provided by:
National Science Foundation (CCF-1815901)
Text and Data Mining valid from 2021-06-29
Version of Record valid from 2021-06-29
Article History
Received: 29 June 2020
Accepted: 9 June 2021
First Online: 29 June 2021