Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: A Heuristic Based on Randomized Greedy Algorithms for the Clustered
  Shortest-Path Tree Problem   Randomized Greedy Algorithms (RGAs) are interesting approaches to solve
problems whose structures are not well understood as well as problems in
combinatorial optimization which incorporate the random processes and the
greedy algorithms. This paper introduces a new algorithm that combines the
major features of RGAs and Shortest Path Tree Algorithm (SPTA) to deal with the
Clustered Shortest-Path Tree Problem (CluSPT). In our algorithm, SPTA is used
to determine the shortest path tree in each cluster while the combination
between characteristics of the RGAs and search strategy of SPTA is used to
constructed the edges connecting clusters. To evaluate the performance of the
proposed algorithm, Euclidean benchmarks are selected. The experimental
investigations show the strengths of the proposed algorithm in comparison with
some existing algorithms. We also analyze the influence of the parameters on
the performance of the algorithm.

11
The categories of this paper are: hep-lat
34
The categories of this paper are: chem-ph
14
The categories of this paper are: math-ph
0
The categories of this paper are: hep-ph
17
The categories of this paper are: q-fin
12
The categories of this paper are: nucl-th
19
The categories of this paper are: eess
13
The categories of this paper are: quant-ph
21
The categories of this paper are: adap-org
24
The categories of this paper are: dg-ga
25
The categories of this paper are: patt-sol
35
The categories of this paper are: mtrl-th
10
The categories of this paper are: q-bio
30
The categories of this paper are: q-alg
22
The categories of this paper are: chao-dyn
2
The categories of this paper are: math