Final project in the course DD2440 Advanced Algorithms at KTH Royal Institute of Technology. Project focused on the Minimum Spanning Forest (MSF) problem, where the task was to implement a sub-linear time algorithm with an approximate solution to the MSF problem.
More details available in the project report
- Kristin Evegård - [email protected]
- Lukas Frösslund - [email protected]