Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: A fast algorithm for the gas station problem   In the gas station problem we want to find the cheapest path between two
vertices of an $n$-vertex graph. Our car has a specific fuel capacity and at
each vertex we can fill our car with gas, with the fuel cost depending on the
vertex. Furthermore, we are allowed at most $\Delta$ stops for refuelling.
  In this short paper we provide an algorithm solving the problem in $O(\Delta
n^2 + n^2\log{n})$ steps improving an earlier result by Khuller, Malekian and
Mestre.

33
The categories of this paper are: plasm-ph
14
The categories of this paper are: math-ph
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
25
The categories of this paper are: patt-sol
13
The categories of this paper are: quant-ph
27
The categories of this paper are: comp-gas
30
The categories of this paper are: q-alg
34
The categories of this paper are: chem-ph
19
The categories of this paper are: eess
8
The categories of this paper are: hep-ex
3
The categories of this paper are: physics
11
The categories of this paper are: hep-lat
24
The categories of this paper are: dg-ga
31
The categories of this paper are: ao-sci