Sciweavers

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

7

WG
2005
Springer

favoriteEmaildiscussreport

91views Theoretical Computer Science» more WG 2005»

Approximation Algorithms for the Bi-criteria Weighted max-cut Problem

13 years 9 months ago

Approximation Algorithms for the Bi-criteria Weighted max-cut Problem

Download www.ibisc.univ-evry.fr

Abstract. We consider a generalization of the classical max-cut problem where two objective functions are simultaneously considered. We derive some theorems on the existence and the non-existence of feasible cuts that are at the same time near optimal for both criteria. Furthermore, two approximation algorithms with performance guarantee are presented. The ﬁrst one is deterministic while the second one is randomized.

Eric Angel, Evripidis Bampis, Laurent Gourvè

Real-time Traffic

Classical Max-cut Problem | Computer Science | Feasible Cuts | Objective Functions | WG 2005 |

claim paper

Related Content

» A Parallel Approximation Algorithm for the Max Cut Problem on Cubic Graphs

» Sampling subproblems of heterogeneous MaxCut problems and approximation algorithms

» A Hierarchical Social Metaheuristic for the MaxCut Problem

» Semidefinite Programming Based Approximation Algorithms

» Optimal Inapproximability Results for MaxCut and Other 2Variable CSPs

» Sampling Subproblems of Heterogeneous Maxcut Problems and Approximation Algorithms

» Improved Approximation of MAXCUT on Graphs of Bounded Degree

» Coresets in dynamic geometric data streams

» Integrality gaps for SheraliAdams relaxations

» Fast SDP Algorithms for Constraint Satisfaction Problems

Post Info
More Details (n/a)

Added	28 Jun 2010
Updated	28 Jun 2010
Type	Conference
Year	2005
Where	WG
Authors	Eric Angel, Evripidis Bampis, Laurent Gourvès

Comments (0)