An exact algorithm for TSP in degree-3 graphs via circuit procedure and amortization on connectivity structure
From MaRDI portal
(Redirected from An exact algorithm for TSP in degree-3 graphs via circuit procedure and amortization on connectivity structure)
Publication:262259
Publication:262259
DOI10.1007/s00453-015-9970-4zbMath1348.90559arXiv1212.6831WikidataQ56032471 ScholiaQ56032471MaRDI QIDQ262259
Hiroshi Nagamochi, Mingyu Xiao
Publication date: 29 March 2016
Published in: Algorithmica, Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1212.6831
graph algorithm; connectivity; traveling salesman problem; cubic graphs; exact exponential algorithm; measure and conquer method; exact exponential algorithms; measure and conquer
90C35: Programming involving graphs or networks
68W40: Analysis of algorithms
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization