Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Hybridizing Non-dominated Sorting Algorithms: Divide-and-Conquer Meets
  Best Order Sort   Many production-grade algorithms benefit from combining an asymptotically
efficient algorithm for solving big problem instances, by splitting them into
smaller ones, and an asymptotically inefficient algorithm with a very small
implementation constant for solving small subproblems. A well-known example is
stable sorting, where mergesort is often combined with insertion sort to
achieve a constant but noticeable speed-up.
  We apply this idea to non-dominated sorting. Namely, we combine the
divide-and-conquer algorithm, which has the currently best known asymptotic
runtime of $O(N (\log N)^{M - 1})$, with the Best Order Sort algorithm, which
has the runtime of $O(N^2 M)$ but demonstrates the best practical performance
out of quadratic algorithms.
  Empirical evaluation shows that the hybrid's running time is typically not
worse than of both original algorithms, while for large numbers of points it
outperforms them by at least 20%. For smaller numbers of objectives, the
speedup can be as large as four times.

34
The categories of this paper are: chem-ph
32
The categories of this paper are: atom-ph
17
The categories of this paper are: q-fin
20
The categories of this paper are: acc-phys
16
The categories of this paper are: stat
27
The categories of this paper are: comp-gas
3
The categories of this paper are: physics
37
The categories of this paper are: supr-con
8
The categories of this paper are: hep-ex
13
The categories of this paper are: quant-ph
11
The categories of this paper are: hep-lat
6
The categories of this paper are: astro-ph
14
The categories of this paper are: math-ph
18
The categories of this paper are: econ
4
The categories of this paper are: cond-mat
23
The categories of this paper are: solv-int