Presents O(nr²) DP algorithms for r-edge and r-facility interdiction covering on trees (and bounded treewidth for the edge version), proves RFIC NP-complete, and gives an O(n³) algorithm for SSBVE on trees.
Multiple allo- cation hub interdiction and protection problems: Model formulations and solution approaches
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Efficient Algorithms for Interdicting Facilities in Trees and Bounded Treewidth Graphs
Presents O(nr²) DP algorithms for r-edge and r-facility interdiction covering on trees (and bounded treewidth for the edge version), proves RFIC NP-complete, and gives an O(n³) algorithm for SSBVE on trees.