arXiv Open Access 2019

The Packed Interval Covering Problem is NP-complete

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

Lihat Sumber

Abstrak

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

Topik & Kata Kunci

cs.CC

Penulis (4)

Abdallah Saffidine

Sébastien Lê Cong

Sophie Pinchinat

François Schwarzentruber

Format Sitasi

APA MLA BibTeX

Saffidine, A., Cong, S.L., Pinchinat, S., Schwarzentruber, F. (2019). The Packed Interval Covering Problem is NP-complete. https://arxiv.org/abs/1906.03676

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2019
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓