Date of Original Version
6-2010
Type
Conference Proceeding
Published In
FOCS 2010, forthcoming
Abstract or Table of Contents
Abstract—We present an algorithm that on input of an n-vertex m-edge weighted graph G and a value k, produces an incremental sparsifier Ĝ with n-1+m=k edges, such that the condition number of G with Ĝ is bounded above by Õ(k log2 n), with probability 1 - p.
COinS