✦ LIBER ✦

New NP-complete partition problems

✍ Scribed by Saeednia, S.

Book ID: 114636813
Publisher: IEEE
Year: 2002
Tongue: English
Weight: 229 KB
Volume: 48
Category: Article
ISSN: 0018-9448
DOI: 10.1109/tit.2002.1013150

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The NP-Completeness of Some Edge-Partiti

The NP-Completeness of Some Edge-Partition Problems

✍ Holyer, Ian 📂 Article 📅 1981 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 474 KB

NP-complete scheduling problems

✍ J.D. Ullman 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 423 KB

We show that the problem of finding an optimal schedule for a set of jobs is NPcomplete even in the following two restricted cases. (1) All jobs require one time unit. (2) All jobs require one or two time units, and there are only two processor resolving (in the negative a conjecture of R. L. Grah

NP-completeness of some problems of part

NP-completeness of some problems of partitioning and covering in graphs

✍ B. Péroche 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 794 KB

Complete problems for monotone NP

✍ Iain A. Stewart 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 768 KB

Certain NP-complete matching problems

✍ G. Loizou 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 311 KB

Node-Deletion NP-Complete Problems

✍ Krishnamoorthy, M. S.; Deo, Narsingh 📂 Article 📅 1979 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 854 KB