The method of extremal structure on the k-maximum cut problem

Authors:
Elena Prieto
Affiliations:
The University of Newcastle, Australia
Venue:
CATS '05 Proceedings of the 2005 Australasian symposium on Theory of computing - Volume 41
Year:
2005

Citing 7
Cited 2

Graph minors. XIII: the disjoint paths problem

Journal of Combinatorial Theory Series B
Polynomial time approximation schemes for dense instances of NP-hard problems

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

Journal of the ACM (JACM)
Parameterizing above guaranteed values: MaxSat and MaxCut

Journal of Algorithms
Vertex cover: further observations and further improvements

Journal of Algorithms
Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT

Discrete Applied Mathematics - The renesse issue on satisfiability
Finding odd cycle transversals

Operations Research Letters

Improved fixed parameter tractable algorithms for two “edge” problems: MAXCUT and MAXDAG

Information Processing Letters
Towards a taxonomy of techniques for designing parameterized algorithms

IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Using the Method of Extremal Structure, which combines the use of reduction rules as a preprocessing technique and combinatorial extremal arguments, we will prove the fixed-parameter tractability and find a problem kernel for k-MAXIMUM CUT. This kernel has 2k edges, the same as that found by Mahajan and Raman in (Mahajan & Raman 1999), but using our methodology we also find a bound of k vertices leading to a running time of O(k 2k/2 + n2).