The lecturer will be Milan Tomić, a final year PhD student and teaching assistant at the School of Computing in Belgrade.
Lecture topic: Spanning trees: NP-hard variants and metaheuristics.
The degree constraint minimum spanning tree (DCMST) stands as one of the fundamental problems in both computer science and combinatorial optimization. In addition, if the goal is to determine the k-subset on which the DCMST is of least cost then the problem is known as the degree constrained k-minimal spanning tree. In this paper, we apply principles of simplicity and change to match and outperform state of the art heuristics on both problems.