Publication:4449176
From MaRDI portal
zbMath1039.68167MaRDI QIDQ4449176
Amin Coja-Oghlan, Vishal Sanwalani, Moore, Cristopher
Publication date: 8 February 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2719/27190200.htm
68Q25: Analysis of algorithms and problem complexity
05C80: Random graphs (graph-theoretic aspects)
68R10: Graph theory (including graph drawing) in computer science
05C85: Graph algorithms (graph-theoretic aspects)
68W25: Approximation algorithms
Related Items
Random MAX SAT, random MAX CUT, and their phase transitions, Spectral techniques applied to sparse random graphs, Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2\(k\)-SAT