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.
Congestion Con- trol as a Service: Towards Low Latency Mobile Upload- ing,
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
years
2026 3verdicts
UNVERDICTED 3representative 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.
Proposes C-L4SaaS architectural framework using NEF-PCF-NWDAF orchestration and discrete-time feedback modeling for automated L4S latency assurance in 5G-Advanced.
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.
-
Closed-Loop L4S-as-a-Service in 5G-Advanced: NEF-PCF Control with NWDAF-Driven Assurance
Proposes C-L4SaaS architectural framework using NEF-PCF-NWDAF orchestration and discrete-time feedback modeling for automated L4S latency assurance in 5G-Advanced.