A \(\frac {9}{7}\)-approximation algorithm for graphic TSP in cubic bipartite graphs (Q2969624)
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 6696511
| 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 6696511 |
Statements
22 March 2017
0 references
approximation algorithms
0 references
traveling salesman problem
0 references
Barnette's conjecture
0 references
combinatorial optimization
0 references
A 9/7 -Approximation Algorithm for Graphic TSP in Cubic Bipartite Graphs (English)
0 references
0.996107816696167
0 references
0.8815188407897949
0 references
0.8687827587127686
0 references
0.8680731654167175
0 references
0.8269303441047668
0 references
