An approximation algorithm for the longest path problem in solid grid graphs (Q2815541)
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 approximation algorithm for the longest path problem in solid grid graphs |
scientific article; zbMATH DE number 6599532
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An approximation algorithm for the longest path problem in solid grid graphs |
scientific article; zbMATH DE number 6599532 |
Statements
An approximation algorithm for the longest path problem in solid grid graphs (English)
0 references
29 June 2016
0 references
longest path
0 references
Hamiltonian path
0 references
approximation algorithm
0 references
solid grid graph
0 references
0.8697081804275513
0 references
0.8368958234786987
0 references
0.833132266998291
0 references
0.8129470348358154
0 references
0.7922884821891785
0 references
