Publication:2934720
From MaRDI portal
zbMath1302.05187arXivmath/0606143MaRDI QIDQ2934720
No author found.
Publication date: 18 December 2014
Full work available at URL: https://arxiv.org/abs/math/0606143
05C15: Coloring of graphs and hypergraphs
05C85: Graph algorithms (graph-theoretic aspects)
68W25: Approximation algorithms
Related Items
Unnamed Item, Spectral Independence in High-Dimensional Expanders and Applications to the Hardcore Model, Approximate Counting via Correlation Decay in Spin Systems, Sublinear-time algorithms for monomer-dimer systems on bounded degree graphs, Correlation decay and deterministic FPTAS for counting colorings of a graph, An FPTAS for the volume of some \(\mathcal{V} \)-polytopes -- it is hard to compute the volume of the intersection of two cross-polytopes, Approximating the volume of unions and intersections of high-dimensional geometric objects, Sequential cavity method for computing free energy and surface pressure, Zero-free regions of partition functions with applications to algorithms and graph limits, A deterministic approximation algorithm for computing the permanent of a 0, 1 matrix, Spatial mixing and the connective constant: optimal bounds