# Keeping track of best algorithms

Is there a site that keeps track of the "current best algorithms", e.g., for certain combinatorial optimization problems?

In the latter there exists a range of classic problems such as MIN st-CUT or MAX FLOW, for which the best algorithms seem to be somewhat hidden in the literature.

• Wikipedia, to some extent. – Yuval Filmus Sep 4 at 11:04

• @smapers "Matrix multiplication is one such example." Is it? You can measure progress on $\omega$ (in $O(n^\omega)$), but many improvements on that front have too large constants in front of the polynomial to be practical. This is why Beniamini and Schwartz argue to also look at the leading coefficient. So, which algorithm is better? One with a larger leading coefficient and smaller exponent or vice versa? I'd say this will depend on $n$, i.e. on you input instance. – Discrete lizard Sep 5 at 13:55