A time- and space-optimal algorithm for the many-visits TSP - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

André Berger, László Kozma 0002, Matthias Mnich, Roland Vincze. A time- and space-optimal algorithm for the many-visits TSP. In Timothy M. Chan, editor, Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, USA, January 6-9, 2019. pages 1770-1782, SIAM, 2019. [doi]

This author has not been identified. Look up 'André Berger' in GoogleThis author has not been identified. Look up 'László Kozma 0002' in GoogleThis author has not been identified. Look up 'Matthias Mnich' in GoogleThis author has not been identified. Look up 'Roland Vincze' in Google

runs on WebDSL