✦ LIBER ✦

The Bandwidth Allocation Problem in the ATM network model is NP-complete

✍ Scribed by Sundararajan Vedantham; S.S. Iyengar

Book ID: 111714075
Publisher: Elsevier Science
Year: 1998
Tongue: English
Weight: 339 KB
Volume: 65
Category: Article
ISSN: 0020-0190
DOI: 10.1016/s0020-0190(98)00226-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Bandwidth Minimization Problem for C

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

✍ Monien, Burkhard 📂 Article 📅 1986 🏛 Society for Industrial and Applied Mathematics ⚖ 963 KB

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.

Channel-Routing Problem in the Knock-Kne

Channel-Routing Problem in the Knock-Knee Mode Is NP-Complete

✍ Sarrafzadeh, M. 📂 Article 📅 1987 🏛 IEEE 🌐 English ⚖ 593 KB

On the problem of capacity allocation an

On the problem of capacity allocation and flow assignment in self-healing ATM networks

✍ Isaac Woungang; Sudip Misra; Mohammad S. Obaidat 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 402 KB

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

A Model for Solving the Optimal Water Al

A Model for Solving the Optimal Water Allocation Problem in River Basins with Network Flow Programming When Introducing Non-Linearities

✍ D. Haro, J. Paredes, A. Solera, J. Andreu 📂 Article 📅 2012 🏛 Springer Netherlands 🌐 English ⚖ 338 KB