A New Node Centroid Algorithm for Bandwidth Minimization
Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence. Pages 1544-1544.
Abstract
We propose a Node Centroid method with HillClimbing to solve the well-known matrix bandwidth minimization problem, which is to permute rows and columns of the matrix to minimize its bandwidth. Many heuristics have been developed for this NP-complete problem including the Cuthill-McKee (CM) and the Gibbs, Poole and Stockmeyer (GPS) algorithms. Recently, heuristics such as Simulated Annealing, Tabu Search and GRASP have been used, where Tabu Search and the GRASP with Path Relinking have achieved significantly better solution quality than the CM and GPS algorithms. Experimentation shows that the Node Centroid method achieves the best solution quality when compared with these while being much faster than the newly-developed algorithms.
@inproceedings{ijcai2003p266,
title = {A New Node Centroid Algorithm for Bandwidth Minimization},
author = {Lim, Andrew and Rodrigues, Brian and Xiao, Fei},
booktitle = {Proceedings of the Eighteenth International Joint Conference on
Artificial Intelligence, {IJCAI-03}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Georg Gottlob},
pages = {1544--1544},
year = {2003},
url = {https://ijcai.org/proceedings/2003/266},
}
TY - CPAPER TI - A New Node Centroid Algorithm for Bandwidth Minimization AU - Lim, Andrew AU - Rodrigues, Brian AU - Xiao, Fei T2 - Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, IJCAI-03 PB - International Joint Conferences on Artificial Intelligence PY - 2003 SP - 1544 EP - 1544 UR - https://ijcai.org/proceedings/2003/266 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
