Towards a taxonomy of techniques for designing parameterized algorithms

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

Volumn 4169 LNCS, Issue , 2006, Pages 251-263

  Sloper, Christian ^a   Telle, Jan Arne ^a  

^a UNIVERSITY OF BERGEN   (Norway)

Author keywords

[No Author keywords available]

Indexed keywords

DATA COMPRESSION; ITERATIVE METHODS; LOGIC DESIGN; OPTIMIZATION; PROBLEM SOLVING;

KERNELIZATION; PARAMETERIZED ALGORITHMS; TAXONOMY;

ALGORITHMS;

EID: 33750271164     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11847250_23     Document Type: Conference Paper

References (31)

1. [ACFL04] F. Abu-Khzam, R. Collins, M. Fellows and M. Langston. Kernelization Algorithms for the Vertex Cover Problem: Theory and Experiments. Proceedings ALENEX 2004, Springer-Verlag, Lecture Notes in Computer Science 3353, p 235-244(2004).
2. [ABFKN02] J. Alber, H. L. Bodlaender, H. Fernau, T. Kloks, and R. Niedermeier. Fixed parameter algorithms for dominating set and related problems on planar graphs, Algorithmica, vol. 33, pages 461-493, 2002.
3. [AYZ95] N. Alon, R. Yuster, and U. Zwick. Color-Coding, Journal of the ACM, Volume 42(4), pages 844-856, 1995.
4. 2) steps. Proceedings of WG2004, LNCS, 2004.
5. [DF99] R. Downey and M. Fellows. Parameterized Complexity, Springer-Verlag, 1999.
6. [DFR03] F. Dehne, M. Fellows, and F. Rosamond. An FPT Algorithm for Set Splitting, in Proceedings WG2004 - 30th Workshop on Graph Theoretic Concepts in Computer science, LNCS. Springer Verlag, 2004.
7. [DFRS04] F. Dehne, M. Fellows, F. Rosamond, P.Shaw. Greedy Localization, Iterative Compression and Modeled Crown Reductions: New FPT Techniques and Improved Algorithms for Max Set Splitting and Vertex Cover, Proceedings of IWPEC04, LNCS 3162, pages 271-281, 2004
8. [DH05] E. Demaine and M. Hajiaghayi. Bidimensionality: New Connections between FPT Algorithms and PTASs, Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2005), January 23-25, pages 590-601, 2005.
9. [F03] M.Fellows. Blow-ups, Win/Wins and Crown Rules: Some New Directions in FPT, Proceedings WG 2003, Springer Verlag LNCS 2880, pages 1-12, 2003.
10. [FKNRSTW04] 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 12th Annual European Symposium on Algorithms (ESA 2004), 2004.
11. [FHRST04] M.Fellows, P.Heggernes, F.Rosamond, C. Sloper, J.A.Telle, Finding k disjoint triangles in an arbitrary graph. To appear in proceedings 30th Workshop on Graph Theoretic Concepts in Computer Science (WG '04), Springer Lecture Notes in Computer Science, (2004).
12. [FMRS00] M.R. Fellows, C. McCartin, F. Rosamond, and U.Stege. Coordinatized Kernels and Catalytic Reductions: An Improved FPT Algorithm for Max Leaf Spanning Tree and Other Problems, Foundations of Software Technology and Theoretical Computer Science, 2000.
13. [JZC04] W. Jia, C. Zhang and J. Chen. An efficient parameterized algorithm for m-set packing, Journal of Algorithms, 2004, vol. 50(1), pages 106-117
14. [K00] O. Kullmann. Investigations on autark assignments, Discrete Applied Mathematics, vol. 107, pages 99-138, 2000.
15. [K03] O. Kullmann. Lean clause-sets: Generalizations of minimally unsatisfiable clause-sets, Discrete Applied Mathematics, vol 130, pages 209-249, 2003.
16. [MPS04] L. Mathieson, E. Prieto, P. Shaw. Packing Edge Disjoint Triangles: A Parameterized View. Proceedings of IWPEC 04, 2004, LNCS 3162,pages 127-137.
17. [M89] U. Manber. Introduction to algorithms, a creative approach, Addison Wesley Publishing, 1989.
18. [MR99] M. Mahajan, V. Raman. Parameterizing above guaranteed values: MaxSat and MaxCut, Journal of Algorithms, vol. 31, issue 2, pages 335-354, 1999.
19. [N02] R. Niedermeier. Invitation to Fixed-Parameter Algorithms. Manuscript, 2002, a book version was recently announced by Oxford University Press.
20. [NR00] R. Niedermeier and P. Rossmanith. A general method to speed up fixed parameter algorithms, Information Processing Letters, 73, pages 125-129, 2000.
21. [NT75] G. Nemhauser and L. Trotter Jr. Vertex Packings: Structural properties and algorithms, Mathematical Programming, 8, pages 232-248, 1975.
22. [P04] E. Prieto. The Method of Extremal Structure on the k-Maximum Cut Problem. Proc. Computing: The Australasian Theory Symposium (CATS 2005). Conferences in Research and Practice in Information Technology, 2005, vol. 41, pages 119-126.
23. [P05] E. Prieto. Systematic kernelization in FPT algorithm design. PhD thesis, University of Newcastle, Australia 2005.
24. [PS03] E. Prieto, C. Sloper. Either/Or: Using Vertex Cover Structure in designing FPT-algorithms - the case of k-Internal Spanning Tree, Proceedings of WADS 2003, LNCS vol 2748, pages 465-483.
25. [PS04] E. Prieto, C. Sloper. Looking at the Stars,Proceedings of International Workshop on Parameterized and Exact Computation (IWPEC 04), LNCS vol. 3162, pages 138-149, 2004.
26. [PS05] E. Prieto, C. Sloper. Reducing to Independent Set Structure - the Case of k-INTERNAL SPANNING TREE', Nordic Journal of Computing, 2005, vol 12, nr 3, pp. 308-318.
27. [RS99] N. Robertson, PD. Seymour. Graph Minors XX Wagner's conjecture. To appear.
28. [RSV03] B.Reed, K.Smith, and A. Vetta. Finding Odd Cycle Transversals, Operations Research Letters, 32, pages 299-301, 2003.
29. [S06] C.Sloper. Techniques in Parameterized Algorithm Design. PhD thesis, University of Bergen, 2006, (http://www.ii.uib.no/sloper).
30. [SS90] J.P. Schmidt and A. Siegel. The spatial complexity of oblivious k-probe hash functions. SIAM Journal of Computing, 19(5), pages 775-786, 1990.
31. [ST94] P. D. Seymour and R. Thomas. Call routing and the ratcatcher. Combinatorica, vol 14(2), pages 217-241, 1994.