Computational complexity of the 2-connected Steiner network problem in the \(\ell_p\) plane (Q2216434)
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 7286334
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computational complexity of the 2-connected Steiner network problem in the \(\ell_p\) plane |
scientific article; zbMATH DE number 7286334 |
Statements
Computational complexity of the 2-connected Steiner network problem in the \(\ell_p\) plane (English)
0 references
16 December 2020
0 references
Steiner network
0 references
2-connected
0 references
NP-completeness
0 references
normed plane
0 references
0 references
0 references
0.8663580417633057
0 references
0.8024302124977112
0 references
0.8024302124977112
0 references
0.7975078821182251
0 references
0.7893016338348389
0 references
