The Packed Interval Covering Problem is NP-complete

Abdallah Saffidine; Sébastien Lê Cong; Sophie Pinchinat; François Schwarzentruber

The Packed Interval Covering Problem is NP-complete

Computational Complexity 2019-06-11 v1

Authors: Abdallah Saffidine , Sébastien Lê Cong , Sophie Pinchinat , François Schwarzentruber

View on arXiv ↗ PDF ↗

Abstract

We introduce a new decision problem, called Packed Interval Covering (PIC) and show that it is NP-complete.

Keywords

computational complexity

Cite

@article{arxiv.1906.03676,
  title  = {The Packed Interval Covering Problem is NP-complete},
  author = {Abdallah Saffidine and Sébastien Lê Cong and Sophie Pinchinat and François Schwarzentruber},
  journal= {arXiv preprint arXiv:1906.03676},
  year   = {2019}
}