3 can be addressed with dual decomposition, a class of optimization techniques that tackle the dual of combinatorial problems in a modular, extensible, and parallelizable manner (Komodakis et al., 2007;Rush et al., 2010).
we employ alternating directions dual decomposition (AD 3 ; Martins et al., 2011a for solving a linear relaxation of Eq.