Algorithms for Lipschitz Learning on Graphs

1 code implementation • 1 May 2015 • Rasmus Kyng, Anup Rao, Sushant Sachdeva, Daniel A. Spielman

We develop fast algorithms for solving regression problems on graphs where one is given the value of a function at some vertices, and must find its smoothest possible extension to all vertices.

Smoothed Analysis of Algorithms: Why the Simplex Algorithm Usually Takes Polynomial Time

no code implementations • 19 Nov 2001 • Daniel A. Spielman, Shang-Hua Teng

We measure this performance in terms of both the input size and the magnitude of the perturbations.

Data Structures and Algorithms G.1.6