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

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.1002/rsa.20600

Publication URI: http://dx.doi.org/10.1002/rsa.20600

Type: Journal Article/Review

Parent Publication: Random Structures & Algorithms

Issue: 3