Exact and Heuristic Algorithms for the Maximum k-Cutset Problem
HAL (Le Centre pour la Communication Scientifique Directe)(2019)
摘要
Given a connected unit-weighted graph, we study the Maximum k-Cutset Problem, consisting in cutting a graph into k vertex-disjoint sub-graphs, each connected. We propose some exact and heuristic solutions to solve the problem. The first Integer Linear Program is based on a combination of a cut model and an assignment model. The two other Integer Linear Programs are based on the existence of spanning trees. The presented heuristics are clustering algorithms using local search. Experiments have been run on randomly generated instances and a specific set of instances. We observe that the running times are related to the tree-arboricity of graphs. The tree-arboricity is also used to ensure the optimality of solutions found by our heuristics.
更多查看译文
关键词
heuristic algorithms,k-cutset
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要