Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Joint Data Compression and Caching: Approaching Optimality with
  Guarantees   We consider the problem of optimally compressing and caching data across a
communication network. Given the data generated at edge nodes and a routing
path, our goal is to determine the optimal data compression ratios and caching
decisions across the network in order to minimize average latency, which can be
shown to be equivalent to maximizing the compression and caching gain under an
energy consumption constraint. We show that this problem is NP-hard in general
and the hardness is caused by the caching decision subproblem, while the
compression sub-problem is polynomial-time solvable. We then propose an
approximation algorithm that achieves a $(1-1/e)$-approximation solution to the
optimum in strongly polynomial time. We show that our proposed algorithm
achieve the near-optimal performance in synthetic-based evaluations. In this
paper, we consider a tree-structured network as an illustrative example, but
our results easily extend to general network topology at the expense of more
complicated notations.

11
The categories of this paper are: hep-lat
10
The categories of this paper are: q-bio
9
The categories of this paper are: nlin
12
The categories of this paper are: nucl-th
23
The categories of this paper are: solv-int
15
The categories of this paper are: nucl-ex
25
The categories of this paper are: patt-sol
29
The categories of this paper are: funct-an
0
The categories of this paper are: hep-ph
7
The categories of this paper are: hep-th
6
The categories of this paper are: astro-ph
32
The categories of this paper are: atom-ph
4
The categories of this paper are: cond-mat
26
The categories of this paper are: bayes-an
31
The categories of this paper are: ao-sci
28
The categories of this paper are: alg-geom