LP relaxation algorithms for the MAP problem define an upper bound on the original objective which takes the form of a linear program.
a minimum of this upper bound can be found using standard LP solvers or, more efficiently, using specialized message passing algorithms (Yanover et al., 2006).