Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

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

Édouard Bonnet et al. (2019)

> Home

Details and statistics

DOI: 10.4230/LIPICS.ESA.2019.23

access: open

type: Conference or Workshop Paper

metadata version: 2019-09-23

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/esa/BonnetIJK19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/esa/BonnetIJK19
Édouard Bonnet, Yoichi Iwata, Bart M. P. Jansen, Lukasz Kowalik:
Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP. ESA 2019: 23:1-23:14

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.