resourceType:"ocw"
country:"United States"
university_name:"Massachusetts Institute of Technology"
tags:" lps and sdps for approximating nphard problems"
tags:" convex geometry"
tags:" cheeger inequalities"
tags:" graph laplacians"
authors:"Kelner, Jonathan"
tags:" iterative methods for linear algebra"
Categories
1 results found in 9 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 nphard problems
 graph laplacians
 cheeger inequalities
 fritz john?s theorem
1 results found.
Page 1 of 1