Publication:4247262
From MaRDI portal
zbMath0929.90086MaRDI QIDQ4247262
Samir Khuller, Refael Hassin, Nili Guttmann-Beck, Balaji Raghavachari
Publication date: 18 January 2000
NP-hard; complete undirected graph; clustered traveling salesman; polynomial time approximation algorithms
90C35: Programming involving graphs or networks
90C60: Abstract computational complexity for mathematical programming problems
Related Items
A \(\frac{5}{3}\)-approximation algorithm for the clusterd traveling salesman tour and path problems