On approximating maximum covering cycles in undirected graphs
Crossref DOI link: https://doi.org/10.1007/s11590-018-1293-3
Published Online: 2018-07-02
Published Print: 2019-03
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Briskorn, Dirk
Text and Data Mining valid from 2018-07-02
Article History
Received: 22 February 2018
Accepted: 27 June 2018
First Online: 2 July 2018