Minimum Hitting Set solver described in my master thesis and a subsequent research paper
-
Updated
Feb 20, 2023 - Rust
Minimum Hitting Set solver described in my master thesis and a subsequent research paper
A Haskell HittingSetModule.hs module exporting a function that finds the lexicographically minimal blocking set, of minimum cardinality, of a family of sets of integers. In the spirit of Theorem 9.12(ii) and Example 9.13 from the monograph A.O. Matveev, Symmetric Cycles, Jenny Stanford Publishing, 2023.
Add a description, image, and links to the hitting-set topic page so that developers can more easily learn about it.
To associate your repository with the hitting-set topic, visit your repo's landing page and select "manage topics."