Approximating Minimum-Cost Connected T-Joins (Q3167389)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximating Minimum-Cost Connected T-Joins |
scientific article |
Statements
Approximating Minimum-Cost Connected T-Joins (English)
0 references
2 November 2012
0 references
approximation algorithms
0 references
LP rounding
0 references
primal-dual method
0 references
prize-collecting problems
0 references
\(T\)-joins
0 references
traveling salesman problem
0 references
\(s\)-\(t\)-path TSP
0 references
