Code for solving the NP-hard casting problem (a variant of graph colouring) using heuristics.
The problem description (in Swedish) can be found here.
-
Notifications
You must be signed in to change notification settings - Fork 0
Realiserad/adkcasting
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
About
Heuristics for creating casts with the minimum amount of actors.