External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP

Édouard Bonnet, Yoichi Iwata, Bart M. P. Jansen, Lukasz Kowalik. Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP. In Michael A. Bender, Ola Svensson, Grzegorz Herman, editors, 27th Annual European Symposium on Algorithms, ESA 2019, September 9-11, 2019, Munich/Garching, Germany. Volume 144 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. [doi]

Authors

Édouard Bonnet

This author has not been identified. Look up 'Édouard Bonnet' in Google

Yoichi Iwata

This author has not been identified. Look up 'Yoichi Iwata' in Google

Bart M. P. Jansen

This author has not been identified. Look up 'Bart M. P. Jansen' in Google

Lukasz Kowalik

This author has not been identified. Look up 'Lukasz Kowalik' in Google
runs on