Skip to content Skip to main navigation Report an accessibility issue

EECS Publication

Scalable Parallel Algorithms for Difficult Combinatorial Problems: A Case Study in Optimization

Faisal N. Abu-Khzam, Michael A. Langston and Pushkar Shanbhag

A novel combination of emergent algorithmic methods, powerful computational platforms and supporting infrastructure is described. These complementary tools and technologies are used to launch systematic attacks on combinatorial problems of significance. As a case study, optimal solutions to very large instances of the N P-hard vertex cover problem are computed. To accomplish this, an efficient sequential algorithm and two forms of parallel algorithms are implemented. The importance of maintaining a balanced decomposition of the search space is shown to be critical to achieving scalability. With the synergistic combination of techniques detailed here, it is now possible to solve problem instances that before were widely viewed as hopelessly out of reach. Target problems need only be amenable to reduction and decomposition. Applications are also discussed.

Published  2003-07-01 04:00:00  as  ut-cs-03-507 (ID:213)


« Back to Listing