A class of spectral bounds for Max k-Cut - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Discrete Applied Mathematics Année : 2020

A class of spectral bounds for Max k-Cut

Résumé

In this paper we introduce a new class of bounds for the maximum -cut problem on undirected edge-weighted simple graphs. The bounds involve eigenvalues of the weighted adjacency matrix together with geometrical parameters. They generalize previous results on the maximum (2-)cut problem and we demonstrate that they can strictly improve over other eigenvalue bounds from the literature. We also report computational results illustrating the potential impact of the new bounds.

Dates et versions

hal-02379981 , version 1 (26-11-2019)

Identifiants

Citer

Miguel F Anjos, José Neto. A class of spectral bounds for Max k-Cut. Discrete Applied Mathematics, 2020, 279, pp.12-24. ⟨10.1016/j.dam.2019.10.002⟩. ⟨hal-02379981⟩
38 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More