is to find a solution that satisfies all requirements of the following subproblems:

(P1) Coloring

:   Every vertex must have exactly one color.

(P2) Bin-Packing

:   For every set $V_i \subseteq V$ comprising all vertices of one color, assign each vertex $v_j \in V_i$ to exactly one bin such that for each bin the sum of the vertex sizes is less or equal to $K$ and at most $B$ bins are used.

(P3) Disjoint Paths

:   Colors of any two vertices $v_i \in P_1$ and $v_j \in P_2$ must be different.

(P4) Matching

:   For every input set of border elements $\mathit{BE}_i$ find a safety area $A_i\subseteq \mathit{BE}_i$ such that all border elements of one area are colored in one color, $|A_i| \leq M$ and every border element is exactly in one area.

(P5) Connectedness

:   Two vertices of the same color must be connected via a path that comprises only vertices of this color.

Let the sample [CCP]{}instance comprise the following parameters: $B=2$, $K=3$, $C=3$ and $M=3$. The solution presented in Figure \[fig:ccp\] assigns 3 colors to vertices, places them into 2 bins, shown in subscript of each vertex, and defines two safety areas $A_1=\{b_1,b_2,b_3\}$ and $A_2=\{b_4,b_5\}$.

#### Heuristics.

