Scalable Parallel Algorithms for FPT Problems

Algorithmic methods based on the theory of fixed-parameter tractability are combined with powerful computational platforms to launch systematic attacks on combinatorial problems of significance. As a case study, optimal solutions to very large instances of the NP-hard vertex cover problem are computed. To accomplish this, an efficient sequential algorithm and various forms of parallel algorithms are devised, implemented and compared. The importance of maintaining a balanced decomposition of the search space is shown to be critical to achieving scalability. Target problems need only be amenable to reduction and decomposition. Applications in high throughput computational biology are also discussed. Key Words Algorithm Design, Parallel Computing, Optimization, Load Balancing, Applications 1 Preliminaries An innovative technique for dealing with foundational N P-complete problems is based on the theory of fixed-parameter tractability. A problem of size n, parameterized by k, is fixed-par...

• Type: Journal
• Year: 2006
• Where: ALGORITHMICA
• Authors: Faisal N. Abu-Khzam, Michael A. Langston, Pushkar Shanbhag, Christopher T. Symons
• Keywords: ALGORITHMICA 2006, Efficient Sequential Algorithm, Fixed-parameter Tractability, Powerful Computational Platforms