In this project, we addressed two fundamental NP-hard problems: the Dominating Set and Hitting Set problems. Led by Dr. Lior Kama and Dr. Sarel Cohen from The Academic College of Tel Aviv-Yaffo, our team developed efficient algorithms using Integer Linear Programming (ILP) and Boolean Satisfiability (SAT) solvers. These approaches leveraged modern solvers to reduce problem size and derive optimal solutions, rigorously tested on diverse datasets for the PACE 2025 competition.

Our work included regular team collaboration, integrating theoretical insights and practical methods into software capable of solving these problems at scale.In this project we aim to submit our solvers to the PACE 2025 competition, while conducting research in the area that will hopefully be concluded with a research paper as well, with the goal to contribute to advancing parameterized complexity and bridging theory with practical applications in combinatorial optimization.