An efficient sparse regularity concept

DOI10.1137/080730160MaRDI QIDQ3058542zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Amin Coja-Oghlan, Colin Cooper, Alan Frieze

Publication date 3 December 2010

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL http://wrap.warwick.ac.uk/43226/1/WRAP_Coja-Oghlan_sparsreg.pdf

zbMATH Keywords

approximation algorithmsmatrix decompositionregularity Lemmacut normrandom discrete structures

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Hypergraphs (05C65)

Recommendations

• An efficient sparse regularity concept
• Quick approximation to matrices and applications
• Computing sparse approximations deterministically
• Approximating sparse binary matrices in the cut-norm
• Approximating the Cut-Norm via Grothendieck's Inequality

Cited in

(15)

• Zero-one rounding of singular vectors
• On the complexity of random satisfiability problems with planted solutions
• Propagation Connectivity of Random Hypergraphs
• Grothendieck-type inequalities in combinatorial optimization
• Quick approximation to matrices and applications
• Regularity properties for sparse regression
• An efficient sparse regularity concept
• SPARSE PARTITION REGULARITY
• An \(L^p\) theory of sparse graph convergence. I: Limits, sparse random graph models, and power law distributions
• Extremal results in sparse pseudorandom graphs
• The Geometry of Sparse Analysis Regularization
• A relative Szemerédi theorem
• Approximating sparse binary matrices in the cut-norm
• Note on strong refutation algorithms for random \(k\)-SAT formulas
• An algorithmic regularity lemma for \(L_p\) regular sparse matrices

This page was built for publication: An efficient sparse regularity concept

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3058542)