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.
The integral stable allocation problem on graphs
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
Overbidding in the non-binding AggregateEU mechanism has ambiguous effects on realized gas trade and can produce highly inefficient outcomes when combined with miscoordination over delivery points.
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.
-
A model-based analysis of the AggregateEU mechanism: Implications of overbidding and non-commitment
Overbidding in the non-binding AggregateEU mechanism has ambiguous effects on realized gas trade and can produce highly inefficient outcomes when combined with miscoordination over delivery points.