A domination algorithm for $\{0,1\}$-instances of the travelling salesman problem (2014)

First Author: Kühn D
Attributed to:  Edge-colourings and Hamilton decompositions of graphs funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.48550/arxiv.1401.4931

Publication URI: https://arxiv.org/abs/1401.4931

Type: Preprint