We are pleased to announce that the paper “An Experimental Evaluation of Static k-Center Clustering Algorithms on Graphs”, authored by Martin Grösbacher and Sebastian Forster, has been accepted for presentation at the 29th SIAM Symposium on Algorithm Engineering and Experiments (ALENEX 2027).

The paper presents an experimental study of algorithms for the static k-center problem on graphs, comparing different algorithmic approaches across graph classes. The study investigates their practical performance, solution quality, and ability to benefit from shared-memory parallelism.

In addition to the experimental evaluation, the paper introduces an implementation-oriented simplification of Thorup’s algorithm and provides a theoretical analysis of the resulting approach.

The work highlights the connection between theoretical algorithm design and practical performance, providing insights into the behavior of k-center algorithms in real-world computational settings.

Congratulations to Martin and Sebastian on this achievement!