James Haralambides, Fillia Makedon. Approximation Algorithms for the Bandwidth Minimization Problem for a Large Class of Trees. In Frank K. H. A. Dehne, Frantisek Fiala, Waldemar W. Koczkodaj, editors, Advances in Computing and Information - ICCI 91, International Conference on Computing and Information, Ottawa, Canada, May 27-29, 1991, Proceedings. Volume 497 of Lecture Notes in Computer Science, pages 66-77, Springer, 1991.
@inproceedings{HaralambidesM91,
title = {Approximation Algorithms for the Bandwidth Minimization Problem for a Large Class of Trees},
author = {James Haralambides and Fillia Makedon},
year = {1991},
researchr = {https://researchr.org/publication/HaralambidesM91},
cites = {0},
citedby = {0},
pages = {66-77},
booktitle = {Advances in Computing and Information - ICCI 91, International Conference on Computing and Information, Ottawa, Canada, May 27-29, 1991, Proceedings},
editor = {Frank K. H. A. Dehne and Frantisek Fiala and Waldemar W. Koczkodaj},
volume = {497},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-54029-6},
}