A GNN-based framework solves the coded caching delivery problem for arbitrary user-cache access topologies with transmission loads close to the index-coding bound at far lower computational cost than exact coloring algorithms.
Computers and intractability: a guide to the theory of np-completeness (michael r. garey and david s. johnson)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A Low-Complexity Framework for Multi-access Coded Caching Systems with Arbitrary User-cache Access Topology
A GNN-based framework solves the coded caching delivery problem for arbitrary user-cache access topologies with transmission loads close to the index-coding bound at far lower computational cost than exact coloring algorithms.