Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Finding Multiple New Optimal Locations in a Road Network   We study the problem of optimal location querying for location based services
in road networks, which aims to find locations for new servers or facilities.
The existing optimal solutions on this problem consider only the cases with one
new server. When two or more new servers are to be set up, the problem with
minmax cost criteria, MinMax, becomes NP-hard. In this work we identify some
useful properties about the potential locations for the new servers, from which
we derive a novel algorithm for MinMax, and show that it is efficient when the
number of new servers is small. When the number of new servers is large, we
propose an efficient 3-approximate algorithm. We verify with experiments on
real road networks that our solutions are effective and attains significantly
better result quality compared to the existing greedy algorithms.

20
The categories of this paper are: acc-phys
16
The categories of this paper are: stat
17
The categories of this paper are: q-fin
24
The categories of this paper are: dg-ga
19
The categories of this paper are: eess
32
The categories of this paper are: atom-ph
33
The categories of this paper are: plasm-ph
14
The categories of this paper are: math-ph
36
The categories of this paper are: cmp-lg
37
The categories of this paper are: supr-con
28
The categories of this paper are: alg-geom
22
The categories of this paper are: chao-dyn
27
The categories of this paper are: comp-gas
21
The categories of this paper are: adap-org
25
The categories of this paper are: patt-sol
31
The categories of this paper are: ao-sci