Interdiction problems on planar graphs (Q897609): Difference between revisions

@@ Property / cites work @@
+The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for NP-complete problems on planar graphs
+Normal rank
@@ Property / cites work @@
+Q4734761
@@ Property / cites work: Q4734761 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4452913
@@ Property / cites work: Q4452913 / rank @@
+Normal rank
@@ Property / cites work @@
+Packing Interdiction and Partial Covering Problems
+Normal rank
@@ Property / cites work @@
+The Rectilinear Steiner Tree Problem is $NP$-Complete
+Normal rank
@@ Property / cites work @@
+The Planar Hamiltonian Circuit Problem is NP-Complete
+Normal rank
@@ Property / cites work @@
+Optimal interdiction policy for a flow network
@@ Property / cites work: Optimal interdiction policy for a flow network / rank @@
+Normal rank
@@ Property / cites work @@
+S-functions for graphs
@@ Property / cites work: S-functions for graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A note on shortest path, assignment, and transportation problems
+Normal rank
@@ Property / cites work @@
+Shortest-path network interdiction
@@ Property / cites work: Shortest-path network interdiction / rank @@
+Normal rank
@@ Property / cites work @@
+Deterministic network interdiction
@@ Property / cites work: Deterministic network interdiction / rank @@
+Normal rank
@@ Property / cites work @@
+On short paths interdiction problems: Total and node-wise limited interdiction
+Normal rank
@@ Property / cites work @@
+The k most vital arcs in the shortest path problem
+Normal rank
@@ Property / cites work @@
+Q2726740
@@ Property / cites work: Q2726740 / rank @@
+Normal rank
@@ Property / cites work @@
+The network inhibition problem
@@ Property / cites work: The network inhibition problem / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. III. Planar tree-width
@@ Property / cites work: Graph minors. III. Planar tree-width / rank @@
+Normal rank
@@ Property / cites work @@
+On budget-constrained flow improvement.
@@ Property / cites work: On budget-constrained flow improvement. / rank @@
+Normal rank
@@ Property / cites work @@
+Network flow interdiction on planar graphs
@@ Property / cites work: Network flow interdiction on planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Matching interdiction
@@ Property / cites work: Matching interdiction / rank @@
+Normal rank