Treedy: A heuristic for counting and sampling subsets

Treedy is a software library for for approximate weighted counting and sampling of subsets. This C++ implementation includes both Treedy and Sorted heuristics as well as the Exact algorithm for the weighted counting task, as described in the following article.

Download the software here: Treedy-1.0.tar.gz

See README for more information.

In case of questions, suggestions or general feedback, please contact Teppo Niinimäki.

Last modified 11 May 2016