Hence, sophisticated approximation techniques based on algorithms such as belief propagation and dual decomposition have been employed.
we propose a simple greedy search approximation for this problem which is very intuitive and easy to implement.