Allan Borodin, University of Toronto What can and cannot be computed by “conceptually simple algorithms"? In this regard, my primary interest is in approximation algorithms for combinatorial optimization problems and… Read More »Online, greedy, and conceptually simple algorithms