Betweenness is an algorithmic problem in order theory about ordering a collection of items subject to constraints that some items must be placed between others. It has applications in bioinformatics, but was shown to be NP-complete by Opatrný (1979).
The input to a betweenness problem is a collection of ordered triples of items. The items listed in these triples should be placed into a total order, with the property that for each of the given triples, the middle item in the triple appears in the output somewhere between the other two items. The items of each triple are not required to be consecutive in the output.
As an example, the collection of input triples
- (2,1,3), (3,4,5), (1,4,5), (2,4,1), (5,2,3)
is satisfied by the output ordering
- 3, 1, 4, 2, 5
but not by
- 3, 1, 2, 4, 5.
In the first of these output orderings, for all five of the input triples, the middle item of the triple appears between the other two items However, for the second output ordering, item 4 is not between items 1 and 2, contradicting the requirement given by the triple (2,4,1).
If an input contains two triples like (1,2,3) and (2,3,1) with the same three items but a different choice of the middle item, then there is no valid solution. However, there are more complicated ways of forming a set of triples with no valid solution, that do not contain such a pair of contradictory triples.
Opatrný (1979) showed that the decision version of the betweenness problem (in which an algorithm must decide whether or not there exists a valid solution) is NP-complete in two ways, by a reduction from 3-satisfiability and also by a different reduction from hypergraph 2-coloring. However, it can easily be solved when all unordered triples of items are represented by an ordered triple of the input, by choosing one of the two items that are not between any others to be the start of the ordering and then using the triples involving this item to compare the relative positions of each pair of remaining items.
The related problem of finding an ordering that maximizes the number of satisfied triples is MAXSNP-hard, implying that it is impossible to achieve an approximation ratio arbitrarily close to 1 in polynomial time unless P = NP. It remains hard to solve or approximate even for dense instances that include an ordered triple for each possible unordered triple of items. One can achieve an approximation ratio of 1/3 (in expectation) by ordering the items randomly, and this simple strategy gives the best possible polynomial-time approximation if the unique games conjecture is true. It is also possible to use semidefinite programming or combinatorial methods to find an ordering that satisfies at least half of the triples of any satisfiable instance, in polynomial time.
In parameterized complexity, the problem of satisfying as many constraints as possible from a set C of constraints is fixed-parameter tractable when parameterized by the difference q − |C|/3 between the solution quality q found by the parameterized algorithm and the |C|/3 quality guaranteed in expectation by a random ordering.
One application of betweenness arises in bioinformatics, as part of the process of gene mapping. Certain types of genetic experiments can be used to determine the ordering of triples of genetic markers, but do not distinguish a genetic sequence from its reversal, so the information yielded from such an experiment determines only which one out of three markers is the middle one. The betweenness problem is an abstraction of the problem of assembling a collection of markers into a single sequence given experimental data of this type.
- Chor, Benny; Sudan, Madhu (1998), "A geometric approach to betweenness", SIAM Journal on Discrete Mathematics 11 (4): 511–523 (electronic), doi:10.1137/S0895480195296221, MR 1640920.
- Slonim, Donna; Kruglyak, Leonid; Stein, Lincoln; Lander, Eric (1997), "Building human genome maps with radiation hybrids", Journal of Computational Biology 4 (4): 487–504, doi:10.1089/cmb.1997.4.487.
- Opatrný, J. (1979), "Total ordering problem", SIAM Journal on Computing 8 (1): 111–114, doi:10.1137/0208008, MR 522973.
- Ailon, Nir; Alon, Noga (2007), "Hardness of fully dense problems", Information and Computation 205 (8): 1117–1129, doi:10.1016/j.ic.2007.02.006, MR 2340896.
- Charikar, Moses; Guruswami, Venkatesan; Manokaran, Rajsekar (2009), "Every permutation CSP of arity 3 is approximation resistant", 24th Annual IEEE Conference on Computational Complexity, pp. 62–73, doi:10.1109/CCC.2009.29, MR 2932455.
- Makarychev, Yury (2012), "Simple linear time approximation algorithm for betweenness", Operations Research Letters 40 (6): 450–452, doi:10.1016/j.orl.2012.08.008, MR 2998680.
- Gutin, Gregory; Kim, Eun Jung; Mnich, Matthias; Yeo, Anders (2010), "Betweenness parameterized above tight lower bound", Journal of Computer and System Sciences 76 (8): 872–878, doi:10.1016/j.jcss.2010.05.001, MR 2722353.
- Chvátal, Vašek; Wu, Baoyindureng (2011), "On Reichenbach's causal betweenness", Erkenntnis 76 (1): 41–48, doi:10.1007/s10670-011-9321-z.