Here is a random picture from a computer science topic
The picture is a counter example of why greedy selection does not work optimally for the set cover problem. If the picture seems not so well done, it's because my asymptote skills are lacking :)
You can probably guess what I'm reading by connecting set cover with combinatorial generation of combinations.
The picture is a counter example of why greedy selection does not work optimally for the set cover problem. If the picture seems not so well done, it's because my asymptote skills are lacking :)
You can probably guess what I'm reading by connecting set cover with combinatorial generation of combinations.
No comments:
Post a Comment