The Packed Interval Covering Problem is NP-complete
Abstract
We introduce a new decision problem, called Packed Interval Covering (PIC) and show that it is NP-complete.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.