resourceType:"ocw"
language:"English"
authors:"Kelner, Jonathan"
tags:"mathematics"
tags:" convex geometry"
tags:" convex geometry"
tags:" fritz john?s theorem"
tags:" cheeger inequalities"
tags:" cheeger inequalities"
tags:" lps and sdps for approximating np-hard problems"
tags:"spectral graph theory"
Categories
1 results found in 4 ms.
Page 1 of 1
More OCW like this |
|
Published by: Massachusetts Institute of Technology | Language: English
Published by: Massachusetts Institute of Technology | Language: English
Share in:
This course covers a collection of geometric techniques that apply broadly in modern algorithm design.
Author(s):
Tag(s):
- mathematics
- spectral graph theory
- iterative methods for linear algebra
- convex geometry
- lattices and basis reduction
- lps and sdps for approximating np-hard problems
- graph laplacians
- cheeger inequalities
- fritz john?s theorem
1 results found.
Page 1 of 1