Greedy approximation techniques in Banach space theory constitute a vibrant area of functional analysis concerned with constructing sparse representations of elements in infinite‐dimensional spaces.

In algorithms, as in life, negativity can be a drag. Consider the problem of finding the shortest path between two points on a graph — a network of nodes connected by links, or edges. Often, these ...