dc.contributor.author Zenklusen, Rico dc.contributor.author Ries, Bernard dc.date.accessioned 2011-05-04T14:45:56Z dc.date.available 2011-05-04T14:45:56Z dc.date.issued 2011 dc.identifier.uri https://basepub.dauphine.fr/handle/123456789/6184 dc.language.iso en en dc.subject Complexity theory en dc.subject Vertex partition en dc.subject Approximation algorithm en dc.subject.ddc 511 en dc.title A 2-approximation for the maximum satisfying bisection problem en dc.type Article accepté pour publication ou publié dc.contributor.editoruniversityother Department of Mathematics, MIT;États-Unis dc.description.abstracten Given a graph G = (V, E), a satisfying bisection of G is a partition of the vertex set V into two sets V1, V2, such that midV1mid = midV2mid, and such that every vertex v set membership, variant V has at least as many neighbors in its own set as in the other set. The problem of deciding whether a graph G admits such a partition is View the MathML source-complete. In Bazgan et al. (2008) [C. Bazgan, Z. Tuza, D. Vanderpooten, Approximation of satisfactory bisection problems, Journal of Computer and System Sciences 75 (5) (2008) 875–883], the authors present a polynomial-time 3-approximation for maximizing the number of satisfied vertices in a bisection. It remained an open problem whether one could find a (3 − c)-approximation, for c > 0 (see Bazgan et al. (2010) [C. Bazgan, Z. Tuza, D. Vanderpooten, Satisfactory graph partition, variants, and generalizations, European Journal of Operational Research 206 (2) (2010) 271–280]). In this paper, we solve this problem by presenting a polynomial-time 2-approximation algorithm for the maximum number of satisfied vertices in a satisfying bisection. en dc.relation.isversionofjnlname European Journal of Operational Research dc.relation.isversionofjnlvol 210 en dc.relation.isversionofjnlissue 2 en dc.relation.isversionofjnldate 2011 dc.relation.isversionofjnlpages 169-175 en dc.relation.isversionofdoi http://dx.doi.org/10.1016/j.ejor.2010.11.010 en dc.description.sponsorshipprivate oui en dc.relation.isversionofjnlpublisher Elsevier en dc.subject.ddclabel Analyse en
﻿

## Files in this item

FilesSizeFormatView

There are no files associated with this item.