Greedy localization, iterative compression, and modeled crown reductions: new fpt techniques, an improved algorithm for set splitting, and a novel 2k kernelization for vertex cover

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3162, Issue , 2004, Pages 271-280

  Dehne, Frank ^a   Fellows, Mike ^b   Rosamond, Frances ^b   Shaw, Peter ^b  

^a GRIFFITH UNIVERSITY   (Australia)

^b UNIVERSITY OF NEWCASTLE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

FPT ALGORITHMS; KERNELIZATION; NEW APPROACHES; SET SPLITTING; VERTEX COVER;

ITERATIVE METHODS;

EID: 35048841147     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-28639-4_24     Document Type: Article

References (33)

1. [ACFLSS04] F. N. Abu-Khzam, R. L. Collins, M. R. Fellows, M. A. Langstom, W. H. Suters, and C. T. Symons. Kernelizatíon algorithms for the Vertex Cover problem: theory and experiments, in Proceedings ALENEX'04, ACM/SIAM, 2004.
2. [AS00] A. A. Ageev and M.I. Sviridenko. An approximation algorithm for hypergraph max k-cut with given sizes of parts, in Proceedings of the European Symposium on Algorithms (ESA) 2000, Springer-Verlag, Lecture Notes in Computer Science 1879 (2000), 32-41.
3. [AYZ95] N. Alon, R. Yuster, and U. Zwick. Color-Coding, in Journal of the ACM, 42 (1995), 844-856.
4. [AE97] G. Andersson and L. Engebretsen. Better approximation algorithms for set splitting and Not-All-Equal SAT, in Information Processing Letters, Vol. 65, pp. 305-311, 1998.
5. 2) Steps). Proceedings WG 2004 - 30th Workshop on Graph Theoretic Concepts in Computer Science, Springer-Verlag,
6. Lecture Notes in Computer Science, 2004 (to appear).
7. [CFJK01] J. Chen, D. K. Friesen, W. Jia and I. A. Kanj. Using Nondeterminism to Design Efficient Deterministic Algorithms, in Proceedings 21st Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Springer-Verlag,
8. Lecture Notes in Computer Science 2245 (2001), 120-131. (Journal version to appear in Algorithmica.)
9. [DFR03] F. Dehne, M. Fellows, and F. Rosamond. An FPT Algorithm for Set Splitting, in Proceedings WG 2003 - 29th Workshop on Graph Theoretic Concepts in Computer Science, Springer-Verlag,
10. Lecture Notes in Computer Science 2880 (2003), 180-191.
11. [DF99] R. G. Downey and M. R. Fellows. Parameterized Complexity. Springer-Verlag, 1999.
12. [F03] M. Fellows. Blow-ups, Win/Win's and Crown Rules: Some New Directions in FPT, in Proceedings WG 2003 - 29th Workshop on Graph Theoretic Concepts in Computer Science, Springer-Verlag,
13. Lecture Notes in Computer Science 2880 (2003), 1-12.
14. [FKN04] M. Fellows, C. Knauer, N. Nishimura, P. Ragde, F. Rosamond, U. Stege, D. Thilikos and S. Whitesides. Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems. Proceedings of the European Symposium on Algorithms (ESA) 2004, Springer-Verlag,
15. Lecture. Notes in Computer Science, 2004 (to appear).
16. [FHRST04] M. Fellows, P. Heggernes, F. Rosamond, C. Sloper, and J.A. Telle. Exact Algorithms for Finding k Disjoint Triangles in an Arbitrary Graph, to appear in Proceedings WG 2004 - 30th Workshop on Graph Theoretic Concepts in Computer Science, Springer-Verlag,
17. Lecture Notes in Computer Science, 2004 (to appear).
18. [GJ79] M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, 1979.
19. [JZC03] W. Jia, C. Zhang, and J. Chen. An Efficient Parameterized Algorithm for Set Packing. Manuscript, 2003, to appear in Journal of Algorithms.
20. [Ma04] D. Marx. Chordal Deletion is Fixed-Parameter Tractable. Manuscript, 2004.
21. [MPS04] L. Mathieson, E. Prieto, and P. Shaw. Packing Edge Disjoint Triangles: A Parameterized View. Proceedings of the International Workshop on Parameterized and Exact Computation, Springer-Verlag,
22. Lecture Notes in Computer Science (this volume), 2004.
23. [Nie02] R. Niedermeier. Invitation to Fixed-Parameter Algorithms, Habilitationschrift, University of Tubingen, 2002.
24. [Pe94] E. Petrank. The hardness of approximation: Gap location. Computational Complexity, 4 (1994), 133-157.
25. [PS03] E. Prieto and C. Sloper. Either/Or: Using Vertex Cover Structure in Designing FPT Algorithms-the Case of k-Internal Spanning Tree. Proceeding of the Work-shop on Algorithms and Data Structures (WADS) 2003, Springer-Verlag,
26. Lecture Notes in Computer Science 2748 (2003), 474-483.
27. [PS04] E. Prieto and C. Sloper. Looking at the Stars. Proceedings of the International Workshop on Parameterized and Exact Computation, Springer-Verlag,
28. Lecture Notes in Computer Science (this volume), 2004.
29. [RSV03] B. Reed, K. Smith, and A. Vetta. Finding Odd Cycle Transversals. Operations Research Letters 32 (2004), 299-301.
30. [Woe03] G. J. Woeginger. Exact Algorithms for NP-Hard Problems: A Survey. Proceedings of 5th International Workshop on Combinatorial Optimization-Eureka, You Shrink! Papers dedicated to Jack Edmonds,
31. M. Junger, G. Reinelt, and G. Rinaldi (Festschrift Eds.) Springer-Verlag, Lecture Notes in Computer Science 2570 (2003), 184-207.
32. [ZL01] H. Zhang and C.X. Ling. An Improved Learning Algorithm for Augmented Naive Bayes. Proceedings of the Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD), Springer-Verlag,
33. Lecture Notes in Computer Science 2035 (2001), 581-586.