This project is a recreation of a uni assignment - to help me learn Rust. A write up about this Set Cover Problem can be found in my other repo (written in Java) --> link here.
The set cover problem is a classical question in combinatorics, computer science, operations research, and complexity theory. It is one of Karp's 21 NP-complete problems shown to be NP-complete in 1972. Given a collection of elements, the set covering problem aims to find the minimum number of sets that incorporate (cover) all of these elements.
This project is a recreation of a uni assignment - to help me learn Rust. A write up about this Set Cover Problem can be found in my other repo (written in Java) --> link here.
The set cover problem is a classical question in combinatorics, computer science, operations research, and complexity theory. It is one of Karp's 21 NP-complete problems shown to be NP-complete in 1972. Given a collection of elements, the set covering problem aims to find the minimum number of sets that incorporate (cover) all of these elements.