The Packed Interval Covering Problem is NP-complete

arxiv: 1906.03676 · v1 · pith:AIEWZVINnew · submitted 2019-06-09 · 💻 cs.CC

Abdallah Saffidine , S\'ebastien L\^e Cong , Sophie Pinchinat , Fran\c{c}ois Schwarzentruber This is my paper

classification 💻 cs.CC

keywords coveringintervalnp-completepackedproblemcalleddecisionintroduce

0 comments

read the original abstract

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

This paper has not been read by Pith yet.