... application of heuristic algorithms. While heuristic algorithms have been well-explored for the closely related Minimum Vertex Cover problem, they have seen limited application in the context of the maximum k-vertex cover problem. Consequently, existing algorithms designed for the Minimum Vertex...

..., K-means and a heuristic. However, these methods typically deliver the varied degrees of grading fairness depending on input score data. Design/methodology/approach To attain the fairest grading, this paper proposes a hybrid algorithm that integrates z score, K-means...