Approximation algorithms for maximum cut with limited unbalance

We consider the problem of partitioning the vertices of a weighted graph into two sets of sizes that differ at most by a given threshold B , so as to maximize the weight of the crossing edges. For B equal to 0 this problem is known as Max Bisection, whereas for B equal to the number n of nodes it is...

Full description

Saved in:

Bibliographic Details
Published in:	Theoretical computer science Vol. 385; no. 1; pp. 78 - 87
Main Authors:	Galbiati, Giulia, Maffioli, Francesco
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 15.10.2007 Elsevier
Subjects:	Algorithmics. Computability. Computer arithmetics Applied sciences Approximations and expansions Computer science; control theory; systems Exact sciences and technology Information retrieval. Graph Limited unbalance cut Mathematical analysis Mathematics Maximum cut Miscellaneous Randomized approximation algorithm Sciences and techniques of general use Semidefinite programming Theoretical computing Randomized approximation algorithm Maximum cut Semidefinite programming Limited unbalance cut Polynomial Computer theory Methodology Polynomial approximation Node Semi definite programming Approximation algorithm Weighted graph Polynomial time Maximum Performance Threshold
ISSN:	0304-3975, 1879-2294
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!