scientific article; zbMATH DE number 1875418

zbMath1159.90405MaRDI QIDQ4796177

Hiroshi Nagamochi, Yoshiyuki Karuno

Publication date: 2 March 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2161/21610218

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)

Related Items (4)

The multiple traveling salesman problem on spiders ⋮ A \(\frac{5}{3}\)-approximation algorithm for scheduling vehicles on a path with release and handling times ⋮ Minmax Tree Cover in the Euclidean Space ⋮ A faster 2-approximation algorithm for the minmax \(p\)-traveling salesmen problem on a tree

This page was built for publication: