"An Iterated Greedy Heuristic for the Minimum-Cardinality Balanced Edge Addition Problem"
Ruben Interian and Celso Ribeiro

The Minimum-Cardinality Balanced Edge Addition Problem (MinCBEAP) appears in the context of polarized networks as a strategy to reduce polarization by external interventions using the minimum number of edges. We show that every instance of MinCBEAP can be reduced to an instance of the Minimum-Cardinality-Bounded-Eccentricity Edge Addition Problem (MCBE). A restarted iterated greedy heuristic is developed for solving MinCBEAP via the transformed MCBE. Preliminary computational results are reported.