A \(\frac{4}{3} \)-approximation algorithm for half-integral cycle cut instances of the TSP (Q7019063)
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 7996012
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A \(\frac{4}{3} \)-approximation algorithm for half-integral cycle cut instances of the TSP |
scientific article; zbMATH DE number 7996012 |
Statements
A \(\frac{4}{3} \)-approximation algorithm for half-integral cycle cut instances of the TSP (English)
0 references
5 March 2025
0 references
traveling salesman problem
0 references
TSP
0 references
approximation algorithm
0 references
half-integral cycle
0 references
graph algorithm
0 references
cycle cut
0 references
subtour LP
0 references
integrality gap
0 references
0 references
0 references
