No video :(

Set Cover Problem Explained - Algorithms in Python

Подписаться 364 тыс.

Просмотров 2,1 тыс.

50% 1

In this video we learn about the set cover problem an how to solve it in Python with two different algorithms. We will also analyze their runtime complexity.
◾◾◾◾◾◾◾◾◾◾◾◾◾◾◾◾◾
📚 Programming Books & Merch 📚
🐍 The Python Bible Book: www.neuralnine...
💻 The Algorithm Bible Book: www.neuralnine...
👕 Programming Merch: www.neuralnine...
💼 Services 💼
💻 Freelancing & Tutoring: www.neuralnine...
🌐 Social Media & Contact 🌐
📱 Website: www.neuralnine...
📷 Instagram: / neuralnine
🐦 Twitter: / neuralnine
🤵 LinkedIn: / neuralnine
📁 GitHub: github.com/Neu...
🎙 Discord: / discord

Опубликовано:

28 авг 2024

Ссылка:

Скачать:

Готовим ссылку...

Добавить в:

Мой плейлист

Посмотреть позже

Комментарии : 7

@lujoconnor 3 месяца назад

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 3 месяца назад

Nice one

@Grow.YT.Views.246 3 месяца назад

This video is on Point!

@y2ksw1 3 месяца назад

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.