Solving Generalized Maximum Dispersion with Linear Programming

Authors:
Gerold Jäger;Anand Srivastav;Katja Wolf
Affiliations:
Department of Computer Science, Washington University, Campus Box 1045, One Brookings Drive, St. Louis, Missouri 63130-4899, USA;Institut für Informatik, Christian-Albrechts-Universität zu Kiel, Christian-Albrechts-Platz 4, D-24118 Kiel, Germany;Zentrum für Paralleles Rechnen Universität zu Köln, Weyertal 80, D-50931 Köln, Germany
Venue:
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Year:
2007

Citing 12
Cited 0

Probabilistic construction of deterministic algorithms: approximating packing integer programs

Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
Algorithmic Chernoff-Hoeffding inequalities in integer programming

Random Structures & Algorithms
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

Journal of the ACM (JACM)
Greedily finding a dense subgraph

Journal of Algorithms
Approximation algorithms for maximization problems arising in graph partitioning

Journal of Algorithms
A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems

Random Structures & Algorithms - Probabilistic methods in combinatorial optimization
Finding Dense Subgraphs with Semidefinite Programming

APPROX '98 Proceedings of the International Workshop on Approximation Algorithms for Combinatorial Optimization
On the densest k-subgraph problems

On the densest k-subgraph problems
Ruling Out PTAS for Graph Min-Bisection, Densest Subgraph and Bipartite Clique

FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
An approximation algorithm for max p-section

STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Approximation algorithms for maximum dispersion

Operations Research Letters
Maximum dispersion problem in dense graphs

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

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