-
Notifications
You must be signed in to change notification settings - Fork 0
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.
MforMahad/Minimum-Tower-Coverage-Problem
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
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.
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published