An Unsupervised Learning Framework Combined with Heuristics for the Maximum Minimal Cut Problem

• Published in: arXiv.org
• Main Authors: Liu, Huaiyuan, Liu, Xianzhang, Yang, Donghua, Wang, Hongzhi, Long, Yingchi, Ji, Mengtong, Miao, Dongjing, Liang, Zhiyu
• Format: Paper Journal Article
• Language: English
• Published: Ithaca Cornell University Library, arXiv.org 16.08.2024
• Subjects: Apexes; Combinatorial analysis; Computer Science - Artificial Intelligence; Computer Science - Learning; Graph neural networks; Graph theory; Heuristic; Machine learning; Solvers; Unsupervised learning
• ISSN: 2331-8422
• DOI: 10.48550/arxiv.2408.08484

The Maximum Minimal Cut Problem (MMCP), a NP-hard combinatorial optimization (CO) problem, has not received much attention due to the demanding and challenging bi-connectivity constraint. Moreover, as a CO problem, it is also a daunting task for machine learning, especially without labeled instances. To deal with these problems, this work proposes an unsupervised learning framework combined with heuristics for MMCP that can provide valid and high-quality solutions. As far as we know, this is the first work that explores machine learning and heuristics to solve MMCP. The unsupervised solver is inspired by a relaxation-plus-rounding approach, the relaxed solution is parameterized by graph neural networks, and the cost and penalty of MMCP are explicitly written out, which can train the model end-to-end. A crucial observation is that each solution corresponds to at least one spanning tree. Based on this finding, a heuristic solver that implements tree transformations by adding vertices is utilized to repair and improve the solution quality of the unsupervised solver. Alternatively, the graph is simplified while guaranteeing solution consistency, which reduces the running time. We conduct extensive experiments to evaluate our framework and give a specific application. The results demonstrate the superiority of our method against two techniques designed.