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 ...

Six years ago, Afonso Bandeira and Shuyang Ling were attempting to come up with a better way to discern clusters in enormous data sets when they stumbled into a surreal world. Ling realized that the ...