GitHub - MforMahad/Minimum-Tower-Coverage-Problem: The project is about solving the Minimum Tower Coverage Problem, which is actually the Minimum Dominating Set problem in graphs. The main idea is: we have a group of nodes — like cities or towers — and we want to place the minimum number of towers so that every city is either a tower or connected to one.

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 1 Commit
TOC_Project		TOC_Project

About

The project is about solving the Minimum Tower Coverage Problem, which is actually the Minimum Dominating Set problem in graphs. The main idea is: we have a group of nodes — like cities or towers — and we want to place the minimum number of towers so that every city is either a tower or connected to one.