An approximation algorithm for the longest cycle problem in solid grid graphs (Q266791)
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 cycle problem in solid grid graphs |
scientific article; zbMATH DE number 6566281
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An approximation algorithm for the longest cycle problem in solid grid graphs |
scientific article; zbMATH DE number 6566281 |
Statements
An approximation algorithm for the longest cycle problem in solid grid graphs (English)
0 references
7 April 2016
0 references
longest cycle
0 references
Hamiltonian cycle
0 references
approximation algorithm
0 references
solid grid graph
0 references
0.8697081804275513
0 references
0.8085699677467346
0 references
0.7967557907104492
0 references
0.782794177532196
0 references
0.7763261795043945
0 references
