The partial inverse minimum cut problem withL1-norm is strongly NP-hard (Q3057531): Difference between revisions

@@ Property / DOI @@
-.1051/ro/2010017
@@ Property / DOI: 10.1051/ro/2010017 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2029899910
@@ Property / OpenAlex ID: W2029899910 / rank @@
+Normal rank
@@ Property / cites work @@
+Inverse Optimization
@@ Property / cites work: Inverse Optimization / rank @@
+Normal rank
@@ Property / cites work @@
+Maximal Flow Through a Network
@@ Property / cites work: Maximal Flow Through a Network / rank @@
+Normal rank
@@ Property / cites work @@
+Some simplified NP-complete graph problems
@@ Property / cites work: Some simplified NP-complete graph problems / rank @@
+Normal rank
@@ Property / cites work @@
+Inverse combinatorial optimization: a survey on problems, methods, and results
+Normal rank
@@ Property / cites work @@
+Complexity of Partial Inverse Assignment Problem and Partial Inverse Cut Problem
+Normal rank
@@ Property / cites work @@
+Inverse problem of minimum cuts
@@ Property / cites work: Inverse problem of minimum cuts / rank @@
+Normal rank
@@ Property / DOI @@
+.1051/RO/2010017
@@ Property / DOI: 10.1051/RO/2010017 / rank @@
+Normal rank

The partial inverse minimum cut problem with<i>L</i><sub>1</sub>-norm is strongly NP-hard (Q3057531): Difference between revisions