✦ LIBER ✦

Bandwidth Minimization: An approximation algorithm for caterpillars

✍ Scribed by J. Haralambides; F. Makedon; B. Monien

Publisher: Springer
Year: 1991
Tongue: English
Weight: 479 KB
Volume: 24
Category: Article
ISSN: 1433-0490
DOI: 10.1007/bf02090396

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An approximation algorithm for state min

An approximation algorithm for state minimization in 2-MDFAs

✍ K. Subramani; C. Tauras 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 157 KB

Approximation Algorithms for the Bandwid

Approximation Algorithms for the Bandwidth Minimization Problem for a Large Class of Trees

✍ J. Haralambides 📂 Article 📅 1997 🏛 Springer 🌐 English ⚖ 327 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.

An effective algorithm for minimization

✍ A. A. Goldstein; J. F. Price 📂 Article 📅 1967 🏛 Springer-Verlag 🌐 English ⚖ 314 KB

Approximation Algorithms for Minimizing

Approximation Algorithms for Minimizing Average Distortion

✍ Kedar Dhamdhere; Anupam Gupta; R. Ravi 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 231 KB

New renumbering algorithm for minimizing

New renumbering algorithm for minimizing the bandwidth of sparse matrices

✍ Takeo Taniguchi; Naruhito Shiraishi 📂 Article 📅 1980 🏛 Elsevier Science ⚖ 633 KB