The method of extremal structure on the k-MAXIMUM CUT problem

Conferences in Research and Practice in Information Technology Series

Volumn 41, Issue , 2005, Pages

  Prieto, Elena ^a  

^a UNIVERSITY OF NEWCASTLE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

EXTREMAL; FIXED-PARAMETER TRACTABILITY; PREPROCESSING TECHNIQUES; PROBLEM KERNEL; REDUCTION RULES; RUNNING TIME;

COMPUTATION THEORY;

EID: 84864016963     PISSN: 14451336     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. S. Arora & D. Karger & M. Karpinski, Polynomial time approximation schemes for dense instances of NP-hard problems, Proc. 27th Ann. ACM Symp. on Theory of Comp., (1995 ), pages 284-293
2. L. Cai & J. Chen & R. Downey & M. Fellows, Advice Classes of Parameterized Tractability, Annals of Pure and Applied Logic 84, (1997), pages 119-138
3. J. Chen & I. Kanj & W. Jia, Vertex cover: Further Observations and Further Improvements, Journal of Algorithms, vol. 41, (2001), pages 280-301
4. R. Downey & M. Fellows & U. Stege, Parameterized Complexity: A Framework for Systematically Confronting Computational Intractability , AMS-DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Volume 49, (1999 ), pages 49-99
5. R. Downey & M. Fellows, Parameterized Complexity, Springer-Verlag , (1999)
6. F. Dehne & M. Fellows & F.Rosamond, An FPT Algorithm for Set Splitting, Proceedings 29th Workshop on Graph Theoretic Concepts in Computer Science, (2003)
7. |E|/4-time AlgorithmforMAXCUT, Zapiski nauchnyh seminarov POMI, No.293. English translation is to appear in Journal of Mathematical Sciences, (2002), pages 129-138
8. M. Fellows & C. McCartin & F. Rosamond & U. Stege, Coordinatized Kernels and Catalytic Reductions: An Improved FPT Algorithm for Max Leaf Spanning Tree Technology and Theoretical Computer Science, (2000)
9. M. Garey & D. Johnson & L. Stockmeyer, Some Simplified NP-complete Graph Problems, SIAMJ. of Computing 1 , (1976 ), pages 237-267
10. M. Goemans & D. Williamson, Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming, Journal ACM 42, (1995), pages 1115-1145
11. J. Gramm & E. Hirsch & R. Niedermeier & P. Rossmanith, Worst-case upper bounds for MAX-2-SAT with application to MAX-CUT, Discrete Applied Mathematics, 130(2), (2003), pages 139-155
12. M. Mahajan & V. Raman, Parameterizing above guaranteed values: MaxSat and MaxCut, Journal of Algorithms Volume 31, Issue 2, (1999), pages 335-354
13. E. Prieto, Systematic Kernelization in FPT Algorithm Design, PhD Thesis. University of Newcastle, Australia. Manuscript under revision, (2004)
14. E. Prieto & C. Sloper, Looking at the Stars, Proc. International Workshop on Parameterized and Exact Computation, (2004 ), pages 474-483
15. S. Poljak & Z. Tuza, Maximum cuts and large bipartite subgraphs, Combinatorial optimization. American Mathematical Society, (1995), pages 181-244
16. C. Papadimitriou & M. Yannakakis, Optimization, approximation, and complexity classes, J. Comput. System Sci. 43, (1991), pages 425-440
17. N. Robertson & PD. Seymour, Graph Minors XIII. The Disjoint Paths Problem, Journal of Combinatorial Theory, Series B, Volume 63, Issue 1, (1995), pages 65-110
18. B. Reed & K. Smith & A. Vetta, Finding Odd Cycle Transversals, accepted to Operations Research Letters, (2003)