Recent advances in algorithm design have shown a growing interest in seeking exact solutions to many hard problems. This new trend has been motivated by hardness of approximation results that appeared in the last decade, and has taken a great boost by the emergence of parameterized complexity theory. Exact algorithms often follow the classical search-tree based recursive backtracking strategy. Different algorithms adopt different branching and pruning techniques in order to reduce the unavoidable exponential growth in run time. This paper is concerned with another time-saving approach by developing new methods for exploiting high-performance computational platforms. A load balancing strategy is presented that could exploit multi-core architectures, such as clusters of symmetric multiprocessors. The well-known Maximum Clique problem is used as an exemplar to illustrate the utility of our approach. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Abu-Khzam, F. N., Rizk, M. A., Abdallah, D. A., & Samatova, N. F. (2008). The buffered work-pool approach for search-tree based optimization algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4967 LNCS, pp. 170–179). https://doi.org/10.1007/978-3-540-68111-3_19
Mendeley helps you to discover research relevant for your work.