Course Description This course is part three of a specialization on algorithms and data structures. It covers basic algorithm design techniques such as divide and conquer, dynamic programming, and ...

Recent developments in the use of greedy algorithms in linear programming are reviewed and extended. We find a common generalization of some theorems of Queyranne—Spieksma— Tardella, Faigle—Kern, and ...

We describe the Fast Greedy Sparse Subspace Clustering (FGSSC) algorithm providing an efficient method for clustering data belonging to a few low-dimensional linear or affine subspaces. FGSSC is a ...