Matching interdiction (Q602686): Difference between revisions

@@ Property / DOI @@
-.1016/j.dam.2010.06.006
@@ Property / DOI: 10.1016/j.dam.2010.06.006 / rank @@
-Normal rank
@@ Property / cites work @@
+Finding the most vital arcs in a network
@@ Property / cites work: Finding the most vital arcs in a network / rank @@
+Normal rank
@@ Property / cites work @@
+A partial k-arboretum of graphs with bounded treewidth
+Normal rank
@@ Property / cites work @@
+A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
+Normal rank
@@ Property / cites work @@
+Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms
+Normal rank
@@ Property / cites work @@
+Q4452913
@@ Property / cites work: Q4452913 / rank @@
+Normal rank
@@ Property / cites work @@
+NP-completeness results for edge modification problems
+Normal rank
@@ Property / cites work @@
+The 0-1 inverse maximum stable set problem
@@ Property / cites work: The 0-1 inverse maximum stable set problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q4875228
@@ Property / cites work: Q4875228 / rank @@
+Normal rank
@@ Property / cites work @@
+Maximizing the minimum source-sink path subject to a budget constraint
+Normal rank
@@ Property / cites work @@
+A problem in network interdiction
@@ Property / cites work: A problem in network interdiction / rank @@
+Normal rank
@@ Property / cites work @@
+Shortest-path network interdiction
@@ Property / cites work: Shortest-path network interdiction / rank @@
+Normal rank
@@ Property / cites work @@
+A factor 2 approximation algorithm for the generalized Steiner network problem
+Normal rank
@@ Property / cites work @@
+On short paths interdiction problems: Total and node-wise limited interdiction
+Normal rank
@@ Property / cites work @@
+Extending Dijkstra’s Algorithm to Maximize the Shortest Path by Node-Wise Limited Arc Interdiction
+Normal rank
@@ Property / cites work @@
+Treewidth. Computations and approximations
@@ Property / cites work: Treewidth. Computations and approximations / rank @@
+Normal rank
@@ Property / cites work @@
+The node-deletion problem for hereditary properties is NP-complete
+Normal rank
@@ Property / cites work @@
+The most vital edges in the minimum spanning tree problem
+Normal rank
@@ Property / cites work @@
+Complexity classification of some edge modification problems
+Normal rank
@@ Property / cites work @@
+The network inhibition problem
@@ Property / cites work: The network inhibition problem / rank @@
+Normal rank
@@ Property / cites work @@
+Blockers and transversals in some subclasses of bipartite graphs: when caterpillars are dancing on a grid
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization. Polyhedra and efficiency (3 volumes)
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for metric facility location and             <i>k</i>             -Median problems using the primal-dual schema and Lagrangian relaxation
+Normal rank
@@ Property / cites work @@
+Deterministic network interdiction
@@ Property / cites work: Deterministic network interdiction / rank @@
+Normal rank
@@ Property / cites work @@
+Edge-Deletion Problems
@@ Property / cites work: Edge-Deletion Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Node-Deletion Problems on Bipartite Graphs
@@ Property / cites work: Node-Deletion Problems on Bipartite Graphs / 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 @@
+Blockers and transversals
@@ Property / cites work: Blockers and transversals / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.DAM.2010.06.006
@@ Property / DOI: 10.1016/J.DAM.2010.06.006 / rank @@
+Normal rank