Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Approximate Shortest Path through a Weighted Planar Subdivision   This paper presents an approximation algorithm for finding a shortest path
between two points $s$ and $t$ in a weighted planar subdivision $\PS$. Each
face $f$ of $\PS$ is associated with a weight $w_f$, and the cost of travel
along a line segment on $f$ is $w_f$ multiplied by the Euclidean norm of that
line segment. The cost of a path which traverses across several faces of the
subdivision is the sum of the costs of travel along each face. Our algorithm
progreeses the discretized shortest path wavefront from source $s$, and takes
polynomial time in finding an $\epsilon$-approximate shortest path.

35
The categories of this paper are: mtrl-th
37
The categories of this paper are: supr-con
31
The categories of this paper are: ao-sci
17
The categories of this paper are: q-fin
12
The categories of this paper are: nucl-th
28
The categories of this paper are: alg-geom
15
The categories of this paper are: nucl-ex
26
The categories of this paper are: bayes-an
4
The categories of this paper are: cond-mat
5
The categories of this paper are: gr-qc
30
The categories of this paper are: q-alg
8
The categories of this paper are: hep-ex
24
The categories of this paper are: dg-ga
36
The categories of this paper are: cmp-lg
23
The categories of this paper are: solv-int
14
The categories of this paper are: math-ph