Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Minimizing Flow Time in the Wireless Gathering Problem   We address the problem of efficient data gathering in a wireless network
through multi-hop communication. We focus on the objective of minimizing the
maximum flow time of a data packet. We prove that no polynomial time algorithm
for this problem can have approximation ratio less than $\Omega(m^{1/3)$ when
$m$ packets have to be transmitted, unless $P = NP$. We then use resource
augmentation to assess the performance of a FIFO-like strategy. We prove that
this strategy is 5-speed optimal, i.e., its cost remains within the optimal
cost if we allow the algorithm to transmit data at a speed 5 times higher than
that of the optimal solution we compare to.

24
The categories of this paper are: dg-ga
31
The categories of this paper are: ao-sci
30
The categories of this paper are: q-alg
5
The categories of this paper are: gr-qc
20
The categories of this paper are: acc-phys
33
The categories of this paper are: plasm-ph
6
The categories of this paper are: astro-ph
7
The categories of this paper are: hep-th
37
The categories of this paper are: supr-con
14
The categories of this paper are: math-ph
11
The categories of this paper are: hep-lat
21
The categories of this paper are: adap-org
9
The categories of this paper are: nlin
17
The categories of this paper are: q-fin
16
The categories of this paper are: stat
27
The categories of this paper are: comp-gas