Exact and Heuristic Algorithms for the Maximum k-Cutset Problem - Université de Lorraine Access content directly
Preprints, Working Papers, ... Year : 2019

Exact and Heuristic Algorithms for the Maximum k-Cutset Problem

Abstract

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.
Fichier principal
Vignette du fichier
MaxKCutsetHAL.pdf (792.52 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02264750 , version 1 (07-08-2019)

Identifiers

  • HAL Id : hal-02264750 , version 1

Cite

Patrick Healy, Pierre Laroche, Franc Marchetti, Sébastien Martin, Zsuzsanna Roka. Exact and Heuristic Algorithms for the Maximum k-Cutset Problem. 2019. ⟨hal-02264750⟩
67 View
176 Download

Share

Gmail Facebook X LinkedIn More