Homogeneous Network Caching is Fixed-Parameter Tractable Parameterized by the Number of Caches
J\'ozsef Pint\'er, Regina Stangl

TL;DR
This paper proves that homogeneous network caching is fixed-parameter tractable when parameterized by the number of caches, resolving a longstanding conjecture and providing an efficient algorithm based on integer programming.
Contribution
The authors demonstrate that the homogeneous network caching problem is fixed-parameter tractable with respect to the number of caches, contrary to previous conjectures.
Findings
Proved fixed-parameter tractability of HomNC parameterized by cache count C.
Developed an exact n-fold integer programming formulation revealing a block structure.
Provided an algorithm with runtime f(C) * |I|^{O(1)} based on standard n-fold integer programming algorithms.
Abstract
Network caching asks how to place contents in distributed caches so that future requests are served close to their users. Ganian, Mc Inerney and Tsigkari recently initiated the parameterized-complexity study of the problem and, for the homogeneous unit-size variant (HomNC), isolated an unresolved family of six parameterizations: by the number of caches , the number of users , , , , and the vertex-cover number , where is the maximum cache capacity and is the maximum number of contents requested with nonzero probability by any user. Their interreducibility theorem showed that these six cases stand or fall together under parameterized reductions, and they conjectured the family to be W[1]-hard. We resolve this conjecture in the opposite direction. We prove that HomNC is fixed-parameter tractable parameterized by alone, and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
