Across three variants of network caching, the paper establishes which parameter combinations admit FPT or XP algorithms and which are paraNP-hard or W[1]-hard, with five open cases shown to be equivalent.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.NI 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Parameterized Complexity of Caching in Networks
Across three variants of network caching, the paper establishes which parameter combinations admit FPT or XP algorithms and which are paraNP-hard or W[1]-hard, with five open cases shown to be equivalent.