Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: k-medoids and p-median clustering are solvable in polynomial time for a
  2d Pareto front   This paper examines a common extension of k-medoids and k-median clustering
in the case of a two-dimensional Pareto front, as generated by bi-objective
optimization approaches. A characterization of optimal clusters is provided,
which allows to solve the optimization problems to optimality in polynomial
time using a common dynamic programming algorithm. More precisely, having $N$
points to cluster in $K$ subsets, the complexity of the algorithm is proven in
$O(N^3)$ time and $O(K.N)$ memory space when $K\geqslant 3$, cases $K=2$ having
a time complexity in $O(N^2)$. Furthermore, speeding-up the dynamic programming
algorithm is possible avoiding useless computations, for a practical speed-up
without improving the complexity. Parallelization issues are also discussed, to
speed-up the algorithm in practice.

19
The categories of this paper are: eess
5
The categories of this paper are: gr-qc
27
The categories of this paper are: comp-gas
34
The categories of this paper are: chem-ph
33
The categories of this paper are: plasm-ph
11
The categories of this paper are: hep-lat
13
The categories of this paper are: quant-ph
18
The categories of this paper are: econ
37
The categories of this paper are: supr-con
10
The categories of this paper are: q-bio
14
The categories of this paper are: math-ph
22
The categories of this paper are: chao-dyn
6
The categories of this paper are: astro-ph
30
The categories of this paper are: q-alg
24
The categories of this paper are: dg-ga
36
The categories of this paper are: cmp-lg