Solving Generalized Maximum Dispersion with Linear Programming

The Generalized Maximum Dispersion problem asks for a partition of a given graph into p vertex-disjoint sets, each of them having at most k vertices. The goal is to maximize the total edge-weight of the induced subgraphs. We present the first LP-based approximation algorithm.

• Type: Conference
• Year: 2007
• Where: AAIM
• Authors: Gerold Jäger, Anand Srivastav, Katja Wolf
• Keywords: AAIM 2007, Algorithms, Generalized Maximum Dispersion, Vertex-disjoint Sets, first Lp-based Approximation