Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems (Q833572)
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: Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems |
scientific article; zbMATH DE number 5595308
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems |
scientific article; zbMATH DE number 5595308 |
Statements
Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems (English)
0 references
14 August 2009
0 references
approximation algorithm
0 references
traveling salesman problem
0 references
cycle cover
0 references
blossom inequalities
0 references
0 references
0 references
0 references
0.91574895
0 references
0.8997144
0 references
0.89453137
0 references
0.8865782
0 references
0.8865782
0 references
0.88354635
0 references
