Computational complexity of the 2-connected Steiner network problem in the \(\ell_p\) plane (Q2216434): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2020.11.002 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3097342811 / rank | |||
Normal rank | |||
Revision as of 21:11, 19 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
