Touring disjoint polygons problem is NP-hard (Q2867133)
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 6237140
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Touring disjoint polygons problem is NP-hard |
scientific article; zbMATH DE number 6237140 |
Statements
Touring Disjoint Polygons Problem Is NP-Hard (English)
0 references
10 December 2013
0 references
0.95263934135437
0 references
0.8502262234687805
0 references
0.8352394104003906
0 references
0.8290620446205139
0 references
0.7732375264167786
0 references
