Evader interdiction: algorithms, complexity and collateral damage (Q490228): Difference between revisions

@@ Property / arXiv ID @@
+.0894
@@ Property / arXiv ID: 1108.0894 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved approximation for directed cut problems
@@ Property / cites work: Improved approximation for directed cut problems / rank @@
+Normal rank
@@ Property / cites work @@
+Finding the <i>n</i> Most Vital Links in Flow Networks
+Normal rank
@@ Property / cites work @@
+Polynomial flow-cut gaps and hardness of directed cut problems
+Normal rank
@@ Property / cites work @@
+Finding the <i>n</i> Most Vital Nodes in a Flow Network
+Normal rank
@@ Property / cites work @@
+Most vital links and nodes in weighted networks
@@ Property / cites work: Most vital links and nodes in weighted networks / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs
+Normal rank
@@ Property / cites work @@
+Graph Algorithms
@@ Property / cites work: Graph Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+A threshold of ln             <i>n</i>             for approximating set cover
+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 @@
+Primal-dual approximation algorithms for integral flow and multicut in trees
+Normal rank
@@ Property / cites work @@
+Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem
+Normal rank
@@ Property / cites work @@
+Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
+Normal rank
@@ Property / cites work @@
+Approximating the <i>k</i>-multicut problem
@@ Property / cites work: Approximating the <i>k</i>-multicut problem / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal Interdiction of Unreactive Markovian Evaders
+Normal rank
@@ Property / cites work @@
+The checkpoint problem
@@ Property / cites work: The checkpoint problem / rank @@
+Normal rank
@@ Property / cites work @@
+Submodular Function Minimization under Covering Constraints
+Normal rank
@@ Property / cites work @@
+Finding All the Elementary Circuits of a Directed Graph
+Normal rank
@@ Property / cites work @@
+Maintenance of a piercing set for intervals with applications
+Normal rank
@@ Property / cites work @@
+Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
+Normal rank
@@ Property / cites work @@
+Greedy ${\ensuremath{\Delta}}$ -Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost
+Normal rank
@@ Property / cites work @@
+Partial multicuts in trees
@@ Property / cites work: Partial multicuts in trees / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal interdiction of a supply network
@@ Property / cites work: Optimal interdiction of a supply network / rank @@
+Normal rank
@@ Property / cites work @@
+The Maximum Coverage Location Problem
@@ Property / cites work: The Maximum Coverage Location Problem / rank @@
+Normal rank
@@ Property / cites work @@
+On the positive-negative partial set cover problem
+Normal rank
@@ Property / cites work @@
+Fast stabbing of boxes in high dimensions
@@ Property / cites work: Fast stabbing of boxes in high dimensions / rank @@
+Normal rank
@@ Property / cites work @@
+Q4452910
@@ Property / cites work: Q4452910 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4228512
@@ Property / cites work: Q4228512 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3002782
@@ Property / cites work: Q3002782 / rank @@
+Normal rank