Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

AAIM
2007
Springer

favoriteEmaildiscussreport

116views Algorithms» more AAIM 2007»

Solving Generalized Maximum Dispersion with Linear Programming

13 years 10 months ago

Solving Generalized Maximum Dispersion with Linear Programming

Download www.numerik.uni-kiel.de

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 ﬁrst LP-based approximation algorithm.

Gerold Jäger, Anand Srivastav, Katja Wolf

Real-time Traffic

AAIM 2007 | Algorithms | Generalized Maximum Dispersion | Vertex-disjoint Sets | ﬁrst Lp-based Approximation |

claim paper

Related Content

» MaximumMargin Matrix Factorization

» A cutting plane method for solving linear generalized disjunctive programming problems

» The Mathematics of Atmospheric Dispersion Modeling

» Mixed Integer Linear Programming for MaximumParsimony Phylogeny Inference

» The Complexity of Generic Primal Algorithms for Solving General Integer Programs

» Interday foreign exchange trading using linear genetic programming

» Messagepassing for Graphstructured Linear Programs Proximal Methods and Rounding Schemes

» Solving Sparse Random Instances of Max Cut and Max 2CSP in Linear Expected Time

» Lower Bounds for Maximum Parsimony with Gene Order Data

Post Info
More Details (n/a)

Added	06 Jun 2010
Updated	06 Jun 2010
Type	Conference
Year	2007
Where	AAIM
Authors	Gerold Jäger, Anand Srivastav, Katja Wolf

Comments (0)