### Table 2. NP-hard problems

1998

"... In PAGE 3: ... Hence, only these two problems are proved to be ordinarily NP-hard. The other NP-hard problems in Table2 as well as the NP-hard J2jno wait; rj; pij = 1jCmax, which is equivalent to J2jno wait; pij = 1jLmax by symmetry, and J2jno wait; pij = 1j Tj are open for the ordinary or strong NP-hardness. The letter C in the machine environment eld denotes a cycle shop, a special case of a job shop, where all the jobs have the same route passing through the machines like in a ow shop but repetitions of machines in the route are allowed.... ..."

Cited by 10

### Table 4: NP-hard subclasses of V.

"... In PAGE 9: ... The relations included in each of these algebras can be found in Table 3. Further, let VNP denote the set of subalgebras listed in Table4 . We have... In PAGE 18: ... Proof: V17 s = DV(V17 f ). 2 2 NP-Hardness Results This section provides NP-hardness proofs for the subclasses of V presented in Table4 . The reductions are mostly made from di erent subalgebras of Allen apos;s interval algebra.... ..."

### Table 4. Reductions proving the NP-hardness

1998

Cited by 10

### Table 1: Complexity status of some unrelated machine problems

2005

Cited by 3

### Table 2.1: Complexity status of some unrelated machine problems.

### Table 1 Formula depth Approximation algorithm NP-hardness factor

2003

### Table 1: Actions in the proof of NP-hardness of S-concurrent executability

"... In PAGE 61: ... Moreover, we add an action which completely clears the database, such that every feasible permutation leads to the empty database. The actions and their descriptions are given in the Table1 below. There Ati;j = VAL(xk; 1) if the j-th literal of clause Ci is xk, and Ati;j = VAL(xk; 0) if it is :xk.... ..."

### Table 13: Auxiliary decision problems for NP-hardness proofs of distance matrix tting decision problems (adapted from [KM86, Day87, Kri88]).

### Table 2.1: Hardness and approximability: Our and previous results. (All NP-hardness results are in strong sense, thus implying the non-existence of a FPTAS. Previous results are displayed between brackets.)

1968