论文信息 - A note on the hardness of Skolem-type sequences

A note on the hardness of Skolem-type sequences

The purpose of this note is to give upper bounds (assuming P different from NP) on how far the generalizations of Skolem sequences can be taken while still hoping to resolve the existence question. We prove that the existence questions for both multi-Skolem sequences and generalized Skolem sequences are strongly NP-complete. These results are significant strengthenings and simplifications of the recent NP-completeness result for generalized multi-Skolem sequences.

Gustav Nordh

[1] Th. Skolem,et al. On certain distributions of integers in pairs with given differences , 1957 .

[2] E.L. Lawler,et al. Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[3] Gerhard J. Woeginger,et al. Multigraph realizations of degree sequences: Maximization is easy, minimization is hard , 2008, Oper. Res. Lett..

[4] Catharine A. Baker,et al. Extended skolem sequences , 1995 .

[5] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[6] C. Colbourn,et al. Handbook of Combinatorial Designs , 2006 .

[7] Zhike Jiang,et al. Extended Langford Sequences with Small Defects , 1998, J. Comb. Theory, Ser. A.

[8] Charles J. Colbourn,et al. The complexity of completing partial Latin squares , 1984, Discret. Appl. Math..

[9] Han Hoogeveen,et al. Minimizing Makespan in a Two-Machine Flow Shop with Delays and Unit-Time Operations is NP-Hard , 2004, J. Sched..

[10] Nabil Shalaby,et al. M-Fold and Extended M-Fold Skolem Sequences , 1994 .

[11] Gustav Nordh. Perfect Skolem sets , 2008, Discret. Math..

[12] Nabil Shalaby,et al. The existence of (p, q)-extended Rosa sequences , 2008, Discret. Math..

[13] Gustav Nordh. NP-completeness of generalized multi-Skolem sequences , 2007, Discret. Appl. Math..