On the Approximability of the Sum-Max Graph Partitioning ProblemReport as inadecuate

On the Approximability of the Sum-Max Graph Partitioning Problem - Download this document for free, or read online. Document in PDF available to download.

* Corresponding author 1 MAORE - Méthodes Algorithmes pour l-Ordonnancement et les Réseaux LIRMM - Laboratoire d-Informatique de Robotique et de Microélectronique de Montpellier

Abstract : In this talk we consider the classical combinatorial optimization graph partitioning problem with Sum-Max as objective function. Given a weighted graph on n vertices and an integer k, our objective is to find a k-partition of its vertices such that the sum of the largest edge weight between each pair of clusters is minimized. We prove, in addition to the NP and W1 hardnesses for the parameter k, that there is no p-approximation algorithm for any p in On^{1-\epsilon}, given any fixed 0 < \epsilon

Author: Rémi Watrigant - Marin Bougeret - Rodolphe Giroudeau - Jean-Claude König -

Source: https://hal.archives-ouvertes.fr/


Related documents