Complexity of min-max subsequence problems

@article{Michiels2003ComplexityOM,
  title={Complexity of min-max subsequence problems},
  author={Wil Michiels and Jan H. M. Korst},
  journal={Inf. Process. Lett.},
  year={2003},
  volume={87},
  pages={213-217}
}
We determine the computational complexity of the problem of ordering a set of n numbers, either into a sequence or a cycle, such that the maximum sum of any k successive numbers is minimal. Both problems are easy for k 2 and strongly NP-hard for any k 3. However, the two problems allow a polynomial-time approximation scheme that is linear in n. keywords: computational complexity, polynomial-time approximation scheme, minmax subsequence problem