scientific article; zbMATH DE number 1302021
From MaRDI portal
Publication:4247262
zbMath0929.90086MaRDI QIDQ4247262
Balaji Raghavachari, Refael Hassin, Samir Khuller, Nili Guttmann-Beck
Publication date: 18 January 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
NP-hardcomplete undirected graphclustered traveling salesmanpolynomial time approximation algorithms
Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)
Related Items (1)
A \(\frac{5}{3}\)-approximation algorithm for the clusterd traveling salesman tour and path problems
This page was built for publication:
