
The Library
An efficient sparse regularity concept
Tools
Coja-Oghlan, Amin, Cooper, Colin and Frieze, Alan (2009) An efficient sparse regularity concept. In: SODA08 19th ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, USA, 20-22 Jan 2008. Published in: SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms pp. 207-216. doi:10.1137/080730160
Research output not available from this repository.
Request-a-Copy directly from author or use local Library Get it For Me service.
Official URL: http://www.siam.org/proceedings/soda/2009/SODA09_0...
Abstract
Let A be a 0/1 matrix of size m x 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. The decomposition can be computed in polynomial time. This result extends the work of Frieze and Kannan (Combinatorica 1999) to sparse matrices. As an application, we obtain efficient 1 - ε approximation algorithms for "bounded" instances of Max CSP problems.
Item Type: | Conference Item (Paper) | ||||
---|---|---|---|---|---|
Subjects: | Q Science > QA Mathematics | ||||
Divisions: | Faculty of Science, Engineering and Medicine > Science > Mathematics | ||||
Journal or Publication Title: | SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms | ||||
Publisher: | SIAM | ||||
Official Date: | 2009 | ||||
Dates: |
|
||||
Page Range: | pp. 207-216 | ||||
DOI: | 10.1137/080730160 | ||||
Status: | Peer Reviewed | ||||
Publication Status: | Published | ||||
Access rights to Published version: | Restricted or Subscription Access | ||||
Conference Paper Type: | Paper | ||||
Title of Event: | SODA08 19th ACM-SIAM Symposium on Discrete Algorithms | ||||
Type of Event: | Conference | ||||
Location of Event: | San Francisco, CA, USA | ||||
Date(s) of Event: | 20-22 Jan 2008 |
Request changes or add full text files to a record
Repository staff actions (login required)
![]() |
View Item |