A 4-approximation algorithm for the TSP-path satisfying a biased triangle inequality (Q2009011)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A 4-approximation algorithm for the TSP-path satisfying a biased triangle inequality |
scientific article; zbMATH DE number 7136948
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A 4-approximation algorithm for the TSP-path satisfying a biased triangle inequality |
scientific article; zbMATH DE number 7136948 |
Statements
A 4-approximation algorithm for the TSP-path satisfying a biased triangle inequality (English)
0 references
27 November 2019
0 references
traveling salesman problem
0 references
traveling salesman path problem
0 references
relaxed \(\triangle\)-inequality
0 references
approximation algorithm
0 references
performance guarantee
0 references
0 references
0 references
0 references
0 references
0 references
0 references
