Login / Signup
Polynomial-time approximation algorithms for the antiferromagnetic Ising model on line graphs.
Martin E. Dyer
Marc Heinrich
Mark Jerrum
Haiko Müller
Published in:
CoRR (2020)
Keyphrases
</>
approximation algorithms
special case
theoretical analysis
graph model
computational complexity
np hard
dynamic programming
minimum cost
np hardness