Distributed Combinatorial Optimization. Abstract. Approximating integer linear programs by solving a relaxation to a linear program (LP) and afterwards reconstructing an integer solution from the fractional one is a standard technique in a non distributed scenario.
maximization problem (fractional packing problem)
Rounding is polynomial, but can be time consuming e.g., if LP relaxation has exponentially many constraints.
The main parts(contributions) of the paper:
and which is decreased every time the corresponding primal constraint is achieved ( ).
Besides that, every dual node has a variable which counts how many times the primal constraint has been fulfilled.