Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: All instantiations of the greedy algorithm for the shortest superstring
  problem are equivalent   In the Shortest Common Superstring problem (SCS), one needs to find the
shortest superstring for a set of strings. While SCS is NP-hard and
MAX-SNP-hard, the Greedy Algorithm "choose two strings with the largest
overlap; merge them; repeat" achieves a constant factor approximation that is
known to be at most 3.5 and conjectured to be equal to 2. The Greedy Algorithm
is not deterministic, so its instantiations with different tie-breaking rules
may have different approximation factors. In this paper, we show that it is not
the case: all factors are equal. To prove this, we show how to transform a set
of strings so that all overlaps are different whereas their ratios stay roughly
the same.
  We also reveal connections between the original version of SCS and the
following one: find a~superstring minimizing the number of occurrences of a
given symbol. It turns out that the latter problem is equivalent to the
original one.

32
The categories of this paper are: atom-ph
26
The categories of this paper are: bayes-an
13
The categories of this paper are: quant-ph
22
The categories of this paper are: chao-dyn
21
The categories of this paper are: adap-org
15
The categories of this paper are: nucl-ex
31
The categories of this paper are: ao-sci
3
The categories of this paper are: physics
27
The categories of this paper are: comp-gas
17
The categories of this paper are: q-fin
33
The categories of this paper are: plasm-ph
8
The categories of this paper are: hep-ex
6
The categories of this paper are: astro-ph
35
The categories of this paper are: mtrl-th
29
The categories of this paper are: funct-an
9
The categories of this paper are: nlin