Advertisement

Further Elementary Techniques

  • Rodney G. Downey
  • Michael R. Fellows
Part of the Texts in Computer Science book series (TCS)

Abstract

We explore a number of elementary techniques including the extremal method, greedy localization and bounded variable integer programming.

References

  1. 8.
    F. Abu-Khzam, A quadratic kernel for 3-set packing, in Theory and Applications of Models of Computation, Proceedings of 6th Annual Conference, TAMC 2009, Changsha, China, May 18–22, 2009, ed. by J. Chen, B. Cooper. LNCS, vol. 5532 (Springer, Berlin, 2009), pp. 81–87 Google Scholar
  2. 30.
    N. Alon, Y. Azar, G. Woeginger, T. Yadid, Approximation schemes for scheduling on parallel machines. J. Sched. 1, 55–66 (1998) MathSciNetCrossRefzbMATHGoogle Scholar
  3. 140.
    J. Chen, H. Fernau, I. Kanj, G. Xia, Parametric duality and kernelization: lower bounds and upper bounds on kernel size. SIAM J. Comput. 37(4), 1077–1106 (2007) MathSciNetCrossRefzbMATHGoogle Scholar
  4. 142.
    J. Chen, D. Friesen, W. Jia, I. Kanj, Using nondeterminism to design efficient deterministic algorithms. Algorithmica 40(2), 83–97 (2004) MathSciNetCrossRefzbMATHGoogle Scholar
  5. 150.
    J. Chen, Y. Liu, S. Lu, B. O’Sullivan, I. Razgon, A fixed-parameter algorithm for the directed feedback vertex set problem. J. ACM 55(5), 1–19 (2008) MathSciNetGoogle Scholar
  6. 203.
    F. Dehne, M. Fellows, H. Fernau, E. Prieto, F. Rosamond, Nonblocker: parameterized algorithmics for minimum dominating set, in Proceedings of the 32nd Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM ’06) (Springer, Berlin, 2006), pp. 237–245 Google Scholar
  7. 204.
    F. Dehne, M. Fellows, F. Rosamond, P. Shaw, 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, in Parameterized and Exact Computation, Proceedings of First International Workshop, IWPEC 2004, Bergen, Norway, September 14–17, 2004, ed. by R. Downey, M. Fellows, F. Dehne. LNCS, vol. 3162 (Springer, Berlin, 2004), pp. 271–281 Google Scholar
  8. 278.
    V. Estivill-Castro, M. Fellows, M. Langston, F. Rosamond, FPT is P-time extremal structure I, in Algorithms and Complexity in Durham 2005, Proceedings of the First ACiD Workshop. Texts in Algorithmics, vol. 4 (King’s College, Dusham, 2005), pp. 1–41 Google Scholar
  9. 287.
    M.R. Fellows, S. Gaspers, F.A. Rosamond, Parameterizing by the number of numbers. Theory Comput. Syst. 50(4), 675–693 (2012) MathSciNetCrossRefzbMATHGoogle Scholar
  10. 288.
    M. Fellows, P. Heggernes, F. Rosamond, C. Sloper, J. Telle, Finding k disjoint triangles in an arbitrary graph, in Graph-Theoretic Concepts in Computer Science. LNCS, vol. 3353 (Springer, Berlin, 2004), pp. 235–244 CrossRefGoogle Scholar
  11. 289.
    M. Fellows, P. Heggernes, F. Rosamond, C. Sloper, J.A. Telle, Exact algorithms for finding k disjoint triangles in an arbitrary graph, in Graph-Theoretic Concepts in Computer Science: 30th International Workshop, WG 2004, Revised Papers, Bad Honnef, Germany, June 2004, ed. by J. Hromkovič, M. Nagl, B. Westfechtel. LNCS, vol. 3353 (Springer, Berlin, 2004), pp. 235–244 CrossRefGoogle Scholar
  12. 292.
    M. Fellows, C. Knauer, N. Nishimura, P. Ragde, F. Rosamond, U. Stege, D. Thilikos, S. Whitesides, Faster fixed-parameter tractable algorithms for matching and packing problems. Algorithmica 52(2), 167–176 (2008) MathSciNetCrossRefzbMATHGoogle Scholar
  13. 350.
    P. Golovach, D. Thilikos, Paths of bounded length and their cuts: parameterized complexity and algorithms. Discrete Optim. 8(1), 72–86 (2011) MathSciNetCrossRefzbMATHGoogle Scholar
  14. 357.
    J. Gramm, R. Niedermeier, P. Rossmanith, Fixed-parameter algorithms for closest string and related problems. Algorithmica 37, 25–42 (2003) MathSciNetCrossRefzbMATHGoogle Scholar
  15. 416.
    W. Jia, C. Zhang, J. Chen, An efficient parameterized algorithm for m-set packing. J. Algorithms 50(1), 106–117 (2004) MathSciNetCrossRefzbMATHGoogle Scholar
  16. 429.
    R. Kannan, Minkowski’s convex body theorem and integer programming. Math. Oper. Res. 12, 415–440 (1987) MathSciNetCrossRefzbMATHGoogle Scholar
  17. 449.
    D. Kleitman, D. West, Spanning trees with many leaves. SIAM J. Discrete Math. 4(1), 99–106 (1991) MathSciNetCrossRefzbMATHGoogle Scholar
  18. 487.
    H. Lenstra, Integer programming with a fixed number of variables. Math. Oper. Res. 8, 538–548 (1983) MathSciNetCrossRefzbMATHGoogle Scholar
  19. 518.
    L. Mathieson, E. Prieto, P. Shaw, Packing edge disjoint triangles: a parameterized view, in Parameterized and Exact Computation, Proceedings of First International Workshop, IWPEC ’04, Bergen, Norway, September 2004, ed. by R. Downey, M. Fellows, F. Dehne. LNCS, vol. 3162 (Springer, Berlin, 2004), pp. 127–137 CrossRefGoogle Scholar
  20. 546.
    R. Niedermeier, Invitation to Fixed-Parameter Algorithms. Oxford Lecture Series in Mathematics and Its Applications, vol. 31 (Oxford University Press, Oxford, 2006) CrossRefGoogle Scholar
  21. 564.
    E. Prieto, Systematic kernelization in FPT algorithm design, PhD thesis, School of Electrical Engineering and Computer Science, University of Newcastle, Australia, 2004 Google Scholar
  22. 565.
    E. Prieto, C. Sloper, Looking at the stars, in Parameterized and Exact Computation, Proceedings of First International Workshop, IWPEC ’04, Bergen, Norway, September 2004, ed. by R. Downey, M. Fellows, F. Dehne. LNCS, vol. 3162 (Springer, Berlin, 2004), pp. 138–148 CrossRefGoogle Scholar
  23. 624.
    C. Sloper, J.A. Telle, Techniques for designing parameterized algorithms. Comput. J. 51(1), 122–136 (2008) CrossRefGoogle Scholar

Copyright information

© Springer-Verlag London 2013

Authors and Affiliations

  • Rodney G. Downey
    • 1
  • Michael R. Fellows
    • 2
  1. 1.School of Mathematics, Statistics and Operations ResearchVictoria UniversityWellingtonNew Zealand
  2. 2.School of Engineering and Information TechnologyCharles Darwin UniversityDarwinAustralia

Personalised recommendations