Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Minmax Regret 1-Sink for Aggregate Evacuation Time on Path Networks   Evacuation in emergency situations can be modeled by a dynamic flow network.
Two criteria have been used before: one is the evacuation completion time and
the other is the aggregate evacuation time of individual evacuees. The aim of
this paper is to optimize the aggregate evacuation time in the simplest case,
where the network is a path and only one evacuation center (called a sink) is
to be introduced. The evacuees are initially located at the vertices, but their
precise numbers are unknown, and are given by upper and lower bounds. Under
this assumption, we compute the sink location that minimizes the maximum
"regret." We present an $O(n^2\log n)$ time algorithm to solve this problem,
improving upon the previously fastest $O(n^3)$ time algorithm, where $n$ is the
number of vertices.

15
The categories of this paper are: nucl-ex
4
The categories of this paper are: cond-mat
34
The categories of this paper are: chem-ph
29
The categories of this paper are: funct-an
5
The categories of this paper are: gr-qc
8
The categories of this paper are: hep-ex
10
The categories of this paper are: q-bio
35
The categories of this paper are: mtrl-th
12
The categories of this paper are: nucl-th
31
The categories of this paper are: ao-sci
28
The categories of this paper are: alg-geom
26
The categories of this paper are: bayes-an
9
The categories of this paper are: nlin
32
The categories of this paper are: atom-ph
21
The categories of this paper are: adap-org
33
The categories of this paper are: plasm-ph