Approximation algorithms for the bi-criteria weighted MAX-CUT problem

Authors:
Eric Angel;Evripidis Bampis;Laurent Gourvès
Affiliations:
LaMI, Université d'Évry Val d'Essonne, France;LaMI, Université d'Évry Val d'Essonne, France;LaMI, Université d'Évry Val d'Essonne, France
Venue:
Discrete Applied Mathematics
Year:
2006

Citing 12
Cited 7

An application of combinatorial optimization to statistical physics and circuit layout design

Operations Research
.879-approximation algorithms for MAX CUT and MAX 2SAT

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

Journal of the ACM (JACM)
Improved bicriteria existence theorems for scheduling

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Algorithmics for hard problems: introduction to combinatorial optimization, randomization, approximation, and heuristics

Algorithmics for hard problems: introduction to combinatorial optimization, randomization, approximation, and heuristics
Existence theorems, lower bounds and algorithms for scheduling to meet two objectives

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
On the approximability of trade-offs and optimal access of Web sources

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Cardinality constrained minimum cut problems: complexity and algorithms

Discrete Applied Mathematics
Bicriteria approximation algorithms for scheduling problems with communications delays

Journal of Scheduling
Multicriteria Optimization

Multicriteria Optimization
Improved approximation algorithms for maximum graph partitioning problems extended abstract

FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
On the existence of schedules that are near-optimal for both makespan and total weighted completion time

Operations Research Letters

Approximating minimum cut with bounded size

INOC'11 Proceedings of the 5th international conference on Network optimization
Single approximation for biobjective max TSP

WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
Approximation with a fixed number of solutions of some biobjective maximization problems

WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
Fair solutions for some multiagent optimization problems

Autonomous Agents and Multi-Agent Systems
Single approximation for the biobjective Max TSP

Theoretical Computer Science
Approximation with a fixed number of solutions of some multiobjective maximization problems

Journal of Discrete Algorithms
A hybrid metaheuristic for multiobjective unconstrained binary quadratic programming

Applied Soft Computing

Quantified Score

Hi-index	0.05

Visualization

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 first one is deterministic while the second one is randomized. A generalization of these results is given for the bi-criteria MAX-k-CUT problem.