On the complexity of two circle connecting problems (Q1314320)
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: On the complexity of two circle connecting problems |
scientific article; zbMATH DE number 501142
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of two circle connecting problems |
scientific article; zbMATH DE number 501142 |
Statements
On the complexity of two circle connecting problems (English)
0 references
29 November 1994
0 references
approximation algorithm
0 references
computational geometry
0 references
connectivity
0 references
divide- and-conquer
0 references
geometric location problem
0 references
NP-hardness
0 references
