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.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
MVR-cache raises semantic cache hit rates by up to 37% on benchmarks using learned prompt segmentation, multi-vector retrieval, and RL training while preserving correctness.
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.
-
MVR-cache: Optimizing Semantic Caching via Multi-Vector Retrieval and Learned Prompt Segmentation
MVR-cache raises semantic cache hit rates by up to 37% on benchmarks using learned prompt segmentation, multi-vector retrieval, and RL training while preserving correctness.