The Packed Interval Covering Problem is NP-complete
arXiv:1906.03676
Abstract
We introduce a new decision problem, called Packed Interval Covering (PIC) and show that it is NP-complete.
arXiv:1906.03676
We introduce a new decision problem, called Packed Interval Covering (PIC) and show that it is NP-complete.