An exact algorithm for MAX-CUT in sparse graphs

Authors:
F. Della Croce;M. J. Kaminski;V. Th. Paschos
Affiliations:
D.A.I., Politecnico di Torino, Italy;RUTCOR, Rutgers University, 640 Bartholomew Road, Piscataway, NJ 08854, USA;LAMSADE, CNRS UMR 7024 and UniversitéParis-Dauphine, France
Venue:
Operations Research Letters
Year:
2007

Citing 5
Cited 2

A note on greedy algorithms for the maximum weighted independent set problem

Discrete Applied Mathematics
On the complexity of the maximum cut problem

Nordic Journal of Computing
Node-and edge-deletion NP-complete problems

STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT

Discrete Applied Mathematics - The renesse issue on satisfiability
A new algorithm for optimal 2-constraint satisfaction and its implications

Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)

New upper bounds for MAX-2-SAT and MAX-2-CSP w.r.t. the average variable degree

IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Linear-programming design and analysis of fast algorithms for Max 2-CSP

Discrete Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study exact algorithms for the MAX-CUT problem. Introducing a new technique, we present an algorithmic scheme that computes a maximum cut in graphs with bounded maximum degree. Our algorithm runs in time O^*(2^(^1^-^(^2^/^@D^)^)^n). We also describe a MAX-CUT algorithm for general graphs. Its time complexity is O^*(2^m^n^/^(^m^+^n^)). Both algorithms use polynomial space.