The Packed Interval Covering Problem is NP-complete

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

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

Knowledge Graph

arrow_drop_up

Comments

Sign up or login to leave a comment