Computational complexity of the 2-connected Steiner network problem in the \(\ell_p\) plane (Q2216434): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 06:21, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Computational complexity of the 2-connected Steiner network problem in the \(\ell_p\) plane |
scientific article |
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