Motivating example: the stable matching problem Greedy (graph) algorithms, BFS, DFS, Dijkstra's, Kruskal's, and Prim's Simple data structures: priority queues (with heaps) and union-find Divide & ...

We describe two recently proposed randomized algorithms for the construction of low-rank approximations to matrices, and demonstrate their application (inter alia) to the evaluation of the singular ...