Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 1 of 1
Full-Text Articles in Engineering
Topics In Graph Algorithms: Structural Results And Algorithmic Techniques, With Applications, Faisal Nabih Abu Khzam
Topics In Graph Algorithms: Structural Results And Algorithmic Techniques, With Applications, Faisal Nabih Abu Khzam
Doctoral Dissertations
Coping with computational intractability has inspired the development of a variety of algorithmic techniques. The main challenge has usually been the design of polynomial time algorithms for NP-complete problems in a way that guarantees some, often worst-case, satisfactory performance when compared to exact (optimal) solutions. We mainly study some emergent techniques that help to bridge the gap between computational intractability and practicality. We present results that lead to better exact and approximation algorithms and better implementations. The problems considered in this dissertation share much in common structurally, and have applications in several scientific domains, including circuit design, network reliability, and …