scientific article
From MaRDI portal
Publication:3549678
zbMath1231.68147MaRDI QIDQ3549678
David Steurer, Madhur Yulsiani, Nisheeth K. Vishnoi, Alexandra Kolla, Subhash A. Khot
Publication date: 5 January 2009
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Games on graphs (graph-theoretic aspects) (05C57)
Related Items (16)
Approximately counting independent sets in bipartite graphs via graph containers ⋮ Pseudorandom sets in Grassmann graph have near-perfect expansion ⋮ Bi-Covering: Covering Edges with Two Small Subsets of Vertices ⋮ Mathematics of computation through the lens of linear equations and lattices ⋮ Spectral algorithms for unique games ⋮ Towards the Erdős-Gallai cycle decomposition conjecture ⋮ Graph Clustering using Effective Resistance ⋮ Approximation Algorithms for CSPs ⋮ Approximating Unique Games Using Low Diameter Graph Decomposition ⋮ Algorithms for #BIS-Hard Problems on Expander Graphs ⋮ The commuting local Hamiltonian problem on locally expanding graphs is approximable in \(\mathsf{NP}\) ⋮ Computational topology and the Unique Games Conjecture ⋮ Hermitian Laplacians and a Cheeger Inequality for the Max-2-Lin Problem ⋮ The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative-Type Metrics into ℓ 1 ⋮ List-Decoding with Double Samplers ⋮ Unnamed Item
This page was built for publication:
