Set Cover Problem Explained - Algorithms in Python

[@mohamedabdelazizkhedri8187]

an other video about implementing Exact Set Cover Problem by DLX will be great. thx

[@lujoconnor]

Funny enough, a tractable case of this problem arose in my research just yesterday. If the subsets are half-open intervals [a,b), then you can sort them by b, and apply DP with the rule that minimum_count(a,b) = 1 + min(minimum_count(a',b'): a

[@obc9794]

Nice one

[@y2ksw1]

For this kind of calculation, artificial intelligence is brilliant, because it can guess the solution. It's like filling randomly an empty container, but the algorithm, which is weight based, keeps track of the yet empty spaces, without actually knowing, where they are. By testing the ever changing formula to a new set, the outcome is known before actually applying it. Modern search engines work that way. Google once, but not any more.

[@vishnubalaji9500]

i dont understand , shouldn't the universe set itself cover the universe and be the minimum set count of 1?

[@adamasadis6193]

The set cover problem consists of a universe set and collection of subsets that are allowed to cover the universe. If this collection contains universe itself then you are right (trivial solution) but if the universe is not in it then you have to combine the other subsets. Notice how quick is greedy algorithm on your example.

[@Al_Miqdad_]

hello I'm trying to run telegram bot and a apschedluer script, does anyone knows how to run both of them in one script ❤❤❤

[@golmatol6537]

Nice.