Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: On the minimum quartet tree cost problem   Given a set of n data objects and their pairwise dissimilarities, the goal of
the minimum quartet tree cost (MQTC) problem is to construct an optimal tree
from the total number of possible combinations of quartet topologies on n,
where optimality means that the sum of the dissimilarities of the embedded (or
consistent) quartet topologies is minimal. We provide details and formulation
of this novel challenging problem, and the preliminaries of an exact algorithm
under current development which may be useful to improve the MQTC heuristics to
date into more efficient hybrid approaches.

14
The categories of this paper are: math-ph
27
The categories of this paper are: comp-gas
31
The categories of this paper are: ao-sci
2
The categories of this paper are: math
35
The categories of this paper are: mtrl-th
9
The categories of this paper are: nlin
29
The categories of this paper are: funct-an
32
The categories of this paper are: atom-ph
0
The categories of this paper are: hep-ph
15
The categories of this paper are: nucl-ex
33
The categories of this paper are: plasm-ph
16
The categories of this paper are: stat
21
The categories of this paper are: adap-org
26
The categories of this paper are: bayes-an
17
The categories of this paper are: q-fin
19
The categories of this paper are: eess