The Packed Interval Covering Problem is NP-complete
We introduce a new decision problem, called Packed Interval Covering (PIC) and show that it is NP-complete.
cs.CC↗
arXiv subjects
Publications and source records attributed to Sébastien Lê Cong.
We introduce a new decision problem, called Packed Interval Covering (PIC) and show that it is NP-complete.