An improved exact algorithm for TSP in graphs of maximum degree 4 (Q255262)
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: An improved exact algorithm for TSP in graphs of maximum degree 4 |
scientific article; zbMATH DE number 6552361
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An improved exact algorithm for TSP in graphs of maximum degree 4 |
scientific article; zbMATH DE number 6552361 |
Statements
An improved exact algorithm for TSP in graphs of maximum degree 4 (English)
0 references
9 March 2016
0 references
traveling salesman problem
0 references
exact exponential algorithm
0 references
graph algorithm
0 references
measure-and-conquer
0 references
0 references
0 references
0.9900466
0 references
0.90177673
0 references
0.88847685
0 references
0.88834953
0 references
0.8872241
0 references
0.8826055
0 references
0.87579155
0 references
0.8750342
0 references
0 references
