The partial inverse minimum cut problem with<i>L</i><sub>1</sub>-norm is strongly NP-hard (Q3057531)
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: The partial inverse minimum cut problem withL1-norm is strongly NP-hard |
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
