A folding preprocess for the max k-cut problem
Sign Up to like & getrecommendations! Published in 2025 at "Optimization Letters"
DOI: 10.1007/s11590-025-02199-0
Abstract: Given graph G=(V,E)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$G=(V,E)$$\end{document} with vertex set V and edge set E, the max k-cut problem seeks to partition the vertex set V into at most k… read more here.
Keywords: max cut; preprocess; problem; cut problem ... See more keywords