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
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Inverse Optimization / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Maximal Flow Through a Network / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Some simplified NP-complete graph problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Inverse combinatorial optimization: a survey on problems, methods, and results / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Complexity of Partial Inverse Assignment Problem and Partial Inverse Cut Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Inverse problem of minimum cuts / rank | |||
Normal rank | |||
Latest revision as of 12:01, 3 July 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
