Pop (2002) also used Lagrangian relaxation -in the non directed case -where a single subproblem is solved in polynomial time.
the relaxed constraints are inequalities: if the dual objective returns a valid primal solution, it is not a sufficient condition in order to guarantee that  Table 3: Dependency parsing and tagging results.