✦ LIBER ✦

The Bandwidth Minimization Problem for Caterpillars with Hair Length 3 is NP-Complete

✍ Scribed by Monien, Burkhard

Book ID: 118213037
Publisher: Society for Industrial and Applied Mathematics
Year: 1986
Weight: 963 KB
Volume: 7
Category: Article
ISSN: 0196-5212
DOI: 10.1137/0607057

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The bandwidth minimization problem for c

The bandwidth minimization problem for cyclic caterpillars with hair length 1 is NP-complete

✍ David Muradian 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 323 KB

In this paper, we show that the bandwidth minimization problem remains NP-complete for cyclic caterpillars with hair length 1. Cyclic caterpillars with hair length 1 are graphs in which the removal of all pendant vertices results in a simple cycle.

Routing with Minimum Wire Length in the

Routing with Minimum Wire Length in the Dogleg-Free Manhattan Model is $\cal NP$-Complete

✍ Szkaliczki, Tibor 📂 Article 📅 1999 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 185 KB

Properties of optimal schedules for the

Properties of optimal schedules for the minimization total weighted completion time in preemptive equal-length job with release dates scheduling problem on a single machine

✍ A. A. Lazarev; A. G. Kvaratskhelia 📂 Article 📅 2010 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 202 KB