A faster 2-approximation algorithm for the minmax \(p\)-traveling salesmen problem on a tree (Q1827840)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A faster 2-approximation algorithm for the minmax \(p\)-traveling salesmen problem on a tree |
scientific article |
Statements
A faster 2-approximation algorithm for the minmax \(p\)-traveling salesmen problem on a tree (English)
0 references
6 August 2004
0 references
Traveling salesman problem
0 references
Vehicle routing
0 references
Tree
0 references
Graph partition
0 references
NP-hard
0 references
Approximation algorithm
0 references
0 references
0 references