The Packed Interval Covering Problem is NP-complete

06/09/2019

∙

by   Abdallah Saffidine, et al.

∙

0

∙

share

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