Hi, I'm also one of the guys strongly attracted by this package. It seems to provide elegant interface for problems that requires elaborate solvers. I feel that set-cover will grow to one of a swiss-army-knife tool like SMT solver DSLs. I have several application problems in my idea list that can be reduced to set cover problems. I've been testing this set-cover for a while, however, me too am finding it hard to understand the library. Although the coherent choices of names and types makes great clues, additional documentation in natural language might help in better understanding. I wish to see some articles of set-cover API and examples, when your time allows. Best regards, Takayuki. 2013-09-08 23:20 GMT+09:00 Johannes Waldmann <waldmann@imn.htwk-leipzig.de>:

Henning Thielemann <lemming <at> henning-thielemann.de> writes:

...

.. package set-cover for solving exact set cover problems. http://hackage.haskell.org/package/set-cover

It's hard to evaluate whether one could use the library because there's essentially no visible documentation.

E.g., what does Math.SetCover.Exact.search do? Its type refers to "State" which seems implementation-dependent, and hides the connection to the specification of the set cover problem.

Putting some text and examples into the haddocks might help. But of course putting the specification there would be even better.

Also, care to explain what algorithm your solver uses, and give some performance data (e.g., N-queens for N=10,20,40,..)?

- J.W.

_______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe