The partial inverse minimum cut problem with<i>L</i><sub>1</sub>-norm is strongly NP-hard (Q3057531): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 21:46, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The partial inverse minimum cut problem with<i>L</i><sub>1</sub>-norm is strongly NP-hard |
scientific article |
Statements
The partial inverse minimum cut problem with<i>L</i><sub>1</sub>-norm is strongly NP-hard (English)
0 references
24 November 2010
0 references
partial inverse minimum cut problem
0 references
