Corpus ID: 215828236

# The complexity of approximating averages on bounded-degree graphs

@article{Galanis2020TheCO,
title={The complexity of approximating averages on bounded-degree graphs},
author={Andreas Galanis and Daniel Stefankovic and Eric Vigoda},
journal={ArXiv},
year={2020},
volume={abs/2004.09238}
}
• Published 2020
• Computer Science, Mathematics
• ArXiv
• We prove that, unless P=NP, there is no polynomial-time algorithm to approximate within some multiplicative constant the average size of an independent set in graphs of maximum degree 6. This is a special case of a more general result for the hard-core model defined on independent sets weighted by a parameter $\lambda>0$. In the general setting, we prove that, unless P=NP, for all $\Delta\geq 3$, all $\lambda>\lambda_c(\Delta)$, there is no FPTAS which applies to all graphs of maximum degree… CONTINUE READING