Computing Simple Circuits from a Set of Line Segments is NP-Complete (Q3034824)
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 4133500
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing Simple Circuits from a Set of Line Segments is NP-Complete |
scientific article; zbMATH DE number 4133500 |
Statements
Computing Simple Circuits from a Set of Line Segments is NP-Complete (English)
0 references
1989
0 references
NP-complete problem
0 references
Hamiltonian path
0 references
Euclidean travelling salesman problem
0 references
computational geometry
0 references
line segments
0 references
complexity classes
0 references
0.8524584770202637
0 references
0.7967691421508789
0 references
0.7752545475959778
0 references
0.7731310725212097
0 references
