Abstract.In this paper, we investigate theMax-Cutproblem and pro-pose a probabilistic heuristic to address its classic and weighted version.Our approach is based on the Estimation of Distribution Algorithm(EDA) that creates a population of individuals capable of evolving ateach generation towards the global solution. We have applied theMax-Cutproblem for image segmentation and de ned the edges' weights asa modi ed function of the L2 norm between the RGB values of nodes.The main goal of this paper is to introduce a heuristic forMax-Cutandadditionally to investigate how it can be applied in the segmentation context.


de Sousa, S., Haxhimusa, Y., & Kropatsch, W. (2013). Estimation of Distribution Algorithm for the Max-Cut Problem. In Lecture Notes in Computer Science. GbR 2013, 9th IAPR - TC-15 Workshop, Wien, Austria. Lecture Notes in Computer Science, Volume 7877, Springer-Verlag. https://doi.org/10.1007/978-3-642-38221-5