A centroid-based approach to solve the bandwidth minimization problem

Proceedings of the Hawaii International Conference on System Sciences

Volumn 37, Issue , 2004, Pages 1203-1208

  Lim, Andrew ^a   Rodrigues, Brian ^b   Xiao, Fei ^c  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^b SINGAPORE MANAGEMENT UNIVERSITY   (Singapore)

^c NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

Bandwidth; Heuristics; Sparse matrices

Indexed keywords

BANDWIDTH MINIMIZATION PROBLEM; GREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURE (GRASP); HEURISTIC ALGORITHM; SPARSE MATRICES;

ALGORITHMS; APPROXIMATION THEORY; BANDWIDTH; COMPUTATIONAL COMPLEXITY; FUNCTION EVALUATION; GRAPH THEORY; HEURISTIC METHODS; MATRIX ALGEBRA; SET THEORY; SIMULATED ANNEALING;

PROBLEM SOLVING;

EID: 12344327369     PISSN: 10603425     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. Arany, I., Smyth, W., F., Szoda, L., An improved method for reducing the bandwidth of sparse symmetric matrices, Proc. IFIP Conference, North-Holland, Amsterdam, 1971, pp: 1246-1250.
2. Berry, M., Hendrickson, B., Raghavan,P.,1996. Sparse matrix reordering schemes for browsing hypertext. In S. Smale J. Renegar, M. Shub, Editor, Lectures in Appl. Math. 32: The Mathematics of Numberical Analysis, pp. 99-123. AMS, Providence, RI, 1996.
3. Blum, A., Konjevod, G., Ravi, R., and Vempala, S. 1998, Semidefinite relaxations for minimum bandwidth and other vertex-ordering problems,Proceedings of the 30th Annual Symposium on the Theory of Computing, 1998.
4. Cuthill, E., McKee, J., 1969. Reducing the bandwidth of sparse symmetric matrices. In: Proceedings of the ACM National Conference, Association for Computing Machinery, New York, pp. 157-172.
5. Diaz, J., Petit, J., and Serna M., A survey on graph layout problems, 2002, ACM Computing Surveys, 34(3):313-356, 2002.
6. Feige U., Approximating the Bandwidth via Volume Respecting Embeddings, 1998, Proceedings of the 30th Annual Symposium on the Theory of Computing, 1998.
7. Garey, M., Graham, R., Johnson, D., Knuth, D., 1978. Complexity results for bandwidth minimization. SIAM J. Applied Mathematics,pp. 34:477-495, 1978.
8. Gibbs, N.E., Poole, W.G., Stockmeyer, P.K., 1976. An algorithm for reducing the bandwidth and profile of sparse matrix. SIAM Journal on Numerical Analysis 13 (2), pp. 236-250.
9. Esposito, A., Catalano, M., S., Malucelli F., Tarricone, L. 1998. Sparse Matrix Bandwidth Reduction: Algorithms, applications and real industrial cases in electromagnetics, 1998. High Performance Algorithms for Structured Matrix Problems, Advances in the theory of Computation and Computational Mathematics Volume 2, pp. 27-45.
10. Esposito, A., Catalano, M., S., Malucelli F., Tarricone, L. 1998. A new matrix bandwidth reduction algorithm, 1998. Operation Research Letters 23, pp. 99-107.
11. Lim, A., Rodrigues, B., Xiao, F.,An Evolutionary Approach to Bandwidth Minimization, 2003, Congress on Evolutionary Computation, 2003.
12. Lim, A., Rodrigues, B., Xiao, F., A New Heuristic Method for the Bandwidth Minimization Problem,2003, Fifth International Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2003.
13. Lim, A., Lin, J., Xiao, F., Particle Swarm Optimization and Hill Climbing to Solve the Bandwidth Minimization Problem, 2003, The Fifth Metaheuristics International Conference.
14. Linial, N., London, E., and Rabinovich Yu., 1995, The geometry of graphs and some of its algorithmic applications, Combinatorica, 15, 215-245, 1995.
15. Marti, R., Laguna, M., Glover, F. and Campos, V., 2001. Reducing the Bandwidth of a Sparse Matrix with Tabu Search, European Journal of Operational Research, 135(2), pp. 211-220.
16. Papadimitriou, C.H., 1976. The NP-completeness of the bandwidth minimization problem. Computing, 16:263-270.
17. Pinana, E., Plana, I., Campos, V. Marti, R., 2002, GRASP and Path Relinking for the Matrix Bandwidth Minimization. In print, European Journal of Operational Research, http://www.uv.es/ rmarti/.