DMCA
Quick Approximation to Matrices and Applications (1998)
Cached
Download Links
- [cluster.cs.yale.edu]
- [www.math.cmu.edu]
- [www.cs.yale.edu]
- DBLP
Other Repositories/Bibliography
| Citations: | 145 - 7 self |
BibTeX
@MISC{Frieze98quickapproximation,
author = {Alan Frieze and Ravi Kannan},
title = {Quick Approximation to Matrices and Applications},
year = {1998}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
We give algorithms to find the following simply described approximation to a given matrix. Given an m \Theta n matrix A with entries between say-1 and 1, and an error parameter ffl between 0 and 1, we find a matrix D (implicitly) which is the sum of O(1=ffl 2 ) simple rank 1 matrices so that the sum of entries of any submatrix (among the 2 m+n ) of (A \Gamma D) is at most fflmn in absolute value. Our algorithm takes time dependent only on ffl and the allowed probability of failure (not on m;n). We draw on two lines of research to develop the algorithms: one is built around the fundamental Regularity Lemma of Szemerédi in Graph Theory and the constructive version of Alon, Duke, Leffman, Rödl and Yuster. The second one is from the papers of Arora, Karger and Karpinski, Fernandez de la Vega and most directly Goldwasser, Goldreich and Ron who develop approximation algorithms for a set of graph problems, typical of which is the maximum cut problem. ?From our matrix approximation, the...
