Innovative formulations, such as the weighted k‐clique density, have paved the way for the design of scalable greedy algorithms with performance guarantees [1].