A \((3/2+1/e)\)-approximation algorithm for ordered TSP (Q6920846)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 8102019
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A \((3/2+1/e)\)-approximation algorithm for ordered TSP |
scientific article; zbMATH DE number 8102019 |
Statements
A \((3/2+1/e)\)-approximation algorithm for ordered TSP (English)
0 references
6 October 2025
0 references
travelling salesperson problem
0 references
precedence constraints
0 references
linear programming
0 references
approximation algorithms
0 references
0 references
0 references
