One-Sided Monge TSP Is NP-Hard

DOI10.1007/11751595_84zbMath1172.90473OpenAlexW1589755537MaRDI QIDQ3600165

Vladimir G. Deǐneko, Alexander Tiskin

Publication date: 10 February 2009

Published in: Computational Science and Its Applications - ICCSA 2006 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11751595_84

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Four-point conditions for the TSP: the complete complexity classification

This page was built for publication: One-Sided Monge TSP Is NP-Hard