A \(\frac{9}{7}\)-approximation algorithm for graphic TSP in cubic bipartite graphs (Q298977)
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 97-approximation algorithm for graphic TSP in cubic bipartite graphs |
scientific article; zbMATH DE number 6595959
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A \(\frac{9}{7}\)-approximation algorithm for graphic TSP in cubic bipartite graphs |
scientific article; zbMATH DE number 6595959 |
Statements
A \(\frac{9}{7}\)-approximation algorithm for graphic TSP in cubic bipartite graphs (English)
0 references
21 June 2016
0 references
approximation algorithms
0 references
traveling salesman problem
0 references
Barnette's conjecture
0 references
combinatorial optimization
0 references
0 references
0.996107816696167
0 references
0.8685154914855957
0 references
0.8547888994216919
0 references
0.8541356921195984
0 references
0.8161808848381042
0 references
