Date of Original Version

6-19-2008

Type

Article

Rights Management

Copyright © Society for Industrial and Applied Mathematics

Abstract or Description

Let A be a 0/1 matrix of size m × n, and let p be the density of A (i.e., the number of ones divided by m · n). We show that A can be approximated in the cut norm within ε · mnp by a sum of cut matrices (of rank 1), where the number of summands is independent of the size m·n of A, provided that A satisfies a certain boundedness condition. This decomposition can be computed in polynomial time. This result extends the work of Frieze and Kannan [16] to sparse matrices. As an application, we obtain efficient 1 − ε approximation algorithms for “bounded” instances of MAX CSP problems.

DOI

10.1137/080730160

Included in

Mathematics Commons

Share

COinS
 

Published In

SIAM Journal on Discrete Mathematics, 23, 4, 2000-2034.