A method for optimizing coordination of a network, wherein the method is implemented in an electronic device coupled to the network including a plurality of cells associated with a radio resource unit, RRU, and wherein each cell is to be assigned to elements (em.P) of a coordination set, C-Set, associated with computing resources corresponding to at least one baseband unit, BBU, the method comprising: identifying a set of cells in a set C to be assigned to elements (em.P) in a first C-Set in Set S; computing a cell_score value between each pair of such cells that are neighbors using a cell_score function; for the first element e1.1 in a first C-Set placing a first cell therein based on a random selection, seeding or other selection basis; for each of the remaining first elements of each subsequent C-Set in set S, assigning, using a greedy algorithm, a cell from Set C that has the lowest cell_score with respect to cells placed as a first element of other C-Sets in S; removing the assigned cell from set C; for each of the second elements of each C-Set in set S, assigning, using a greedy algorithm, a further cell from set C that has the highest cell_score with respect to the previously assigned cell placed as first element in the same C-Set in S, and removing the further cell from set C; for each of the third elements of each C-Set in set S, assigning, using a greedy algorithm, one of the remaining cells from set C that increases the most or decreases the least the cell_score with respect to the cells already placed in the same C-Set in S, and removing it from set C; and repeating the foregoing step for each next element in each C-Set until all cells from set C are placed, such that operation of each cell in Set C is assigned with computing resources corresponding to at least one baseband unit, BBU, associated with a C-Set in which the respective cell is placed into. identifying a set of cells in a set C to be assigned to elements (em.P) in a first C-Set in Set S; computing a cell_score value between each pair of such cells that are neighbors using a cell_score function; for the first element e1.1 in a first C-Set placing a first cell therein based on a random selection, seeding or other selection basis; for each of the remaining first elements of each subsequent C-Set in set S, assigning, using a greedy algorithm, a cell from Set C that has the lowest cell_score with respect to cells placed as a first element of other C-Sets in S; removing the assigned cell from set C; for each of the second elements of each C-Set in set S, assigning, using a greedy algorithm, a further cell from set C that has the highest cell_score with respect to the previously assigned cell placed as first element in the same C-Set in S, and removing the further cell from set C; for each of the third elements of each C-Set in set S, assigning, using a greedy algorithm, one of the remaining cells from set C that increases the most or decreases the least the cell_score with respect to the cells already placed in the same C-Set in S, and removing it from set C; and repeating the foregoing step for each next element in each C-Set until all cells from set C are placed, such that operation of each cell in Set C is assigned with computing resources corresponding to at least one baseband unit, BBU, associated with a C-Set in which the respective cell is placed into.