An LP-based \(\frac{3}{2}\)-approximation algorithm for the \(s-t\) path graph traveling salesman problem (Q2450741)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An LP-based \(\frac{3}{2}\)-approximation algorithm for the \(s-t\) path graph traveling salesman problem |
scientific article |
Statements
An LP-based \(\frac{3}{2}\)-approximation algorithm for the \(s-t\) path graph traveling salesman problem (English)
0 references
15 May 2014
0 references
approximation algorithms
0 references
linear programming
0 references
\(s-t\) path traveling salesman problem
0 references
