Theory 42 (1996) 2118-2132] to construct learning algorithms based on greedy approximations which are universally consistent and provide provable convergence rates for large classes of functions.

Where Graph Theory Meets The Road: The Algorithms Behind Route Planning 33 Comments by: Maya Posch April 4, 2024 ...

We consider the expected performance of two greedy matching algorithms on sparse random graphs and also on random trees. In all cases we establish expressions for the mean and variance of the number ...

On the 19th of February 2025, M.Sc. Andreas Grigorjew defends his PhD thesis on Algorithms and Graph Structures for Splitting Network Flows, in Theory and Practice. The thesis is related to research ...