Jul 2026
Improved Learning with Structure: Fine-Grained Complexity of Minimum Consistent Subset
A comprehensive fine-grained complexity map of MCS on both unweighted and weighted graphs is developed and the results strictly delineate the algorithmic boundaries of consistent subset selection across diverse metric structures.
R. Ganian, M. Vasilakis, Simon Wietheger
· arXiv.org · 0 citations