Approximating Max Cut with Limited Unbalance

Given a graph G with a label (color) assigned to each edge (not necessarily properly) we look for an hamiltonian cycle of G with the minimum number of different colors. The problem has several applications in telecommunication networks, electric networks, multimodal transportation networks, among others, where one aims to ensure connectivity or other properties by means of limited number of different connections. We analyze the complexity of the problem on special graph classes and propose, for the general case, heuristic resolution algorithms. Performances of the algorithms are experimentally evaluated on a set of instances and compared with the exact solution value provided by a solver.