A cutting-plane algorithm for solving a weighted influence interdiction problem (Q2436687): Difference between revisions

@@ Property / cites work @@
+Emergence of Scaling in Random Networks
@@ Property / cites work: Emergence of Scaling in Random Networks / rank @@
+Normal rank
@@ Property / cites work @@
+Q5692521
@@ Property / cites work: Q5692521 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Approximability of Influence in Social Networks
+Normal rank
@@ Property / cites work @@
+Q5489870
@@ Property / cites work: Q5489870 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Fundamentals of Computation Theory
@@ Property / cites work: Fundamentals of Computation Theory / rank @@
+Normal rank
@@ Property / cites work @@
+An analysis of approximations for maximizing submodular set functions—I
+Normal rank
@@ Property / cites work @@
+Exact interdiction models and algorithms for disconnecting networks via node deletions
+Normal rank
@@ Property / cites work @@
+Q3528714
@@ Property / cites work: Q3528714 / rank @@
+Normal rank
@@ Property / cites work @@
+Deterministic network interdiction
@@ Property / cites work: Deterministic network interdiction / rank @@
+Normal rank
@@ Property / cites work @@
+Power domination in graphs
@@ Property / cites work: Power domination in graphs / rank @@
+Normal rank