Linear problem kernels for NP-hard problems on planar graphs

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

Volumn 4596 LNCS, Issue , 2007, Pages 375-386

  Guo, Jiong ^a   Niedermeier, Rolf ^a  

^a FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA REDUCTION; GRAPH THEORY; PROBLEM SOLVING;

COMPUTATIONAL INTRACTABILITY; LINEAR PROBLEM KERNELS;

LINEAR PROGRAMMING;

EID: 38149015469     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73420-8_34     Document Type: Conference Paper

References (22)

1. Abu-Khzam, F.N., Collins, R.L., Fellows, M.R., Langston, M.A., Suters, W.H., Symons, C.T.: Kernelization algorithms for the Vertex Cover problem: theory and experiments. In: Proc. 6th ACM-SIAM ALENEX, pp. 62-69. ACM Press, New York (2004)
2. Alber, J., Betzler, N., Niedermeier, R.: Experiments on data reduction for optimal domination in networks. Annals of Operations Research 146(1), 105-117 (2006)
3. Alber, J., Dorn, B., Niedermeier, R.: A general data reduction scheme for domination in graphs. In: Wiedermann, J., Tel, C., Pokorný, J., Bieliková, M., Štuller, J. (eds.) SOFSEM 2006. LNCS, vol. 3831, pp. 137-147. Springer, Heidelberg (2006)
4. Alber, J., Fellows, M.R., Niedermeier, R.: Polynomial time data reduction for Dominating Set. Journal of the ACM 51(3), 363-384 (2004)
5. Baker, B.S.: Approximation algorithms for NP-complete problems on planar graphs. Journal of the ACM 41(1), 153-180 (1994)
6. Bange, D.W., Barkauskas, A.E., Slater, P.J.: Efficient dominating sets in graphs. In: Proc. 3rd Conference on Discrete Mathematics. SIAM, pp. 189-199 (1988) SIAM
7. Chen, J., Fernau, H., Kanj, I.A., Xia, G.: Parametric duality and kernelization: Lower bounds and upper bounds on kernel size. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol. 3404, pp. 269-280. Springer, Heidelberg (2005)
8. Chen, J., Kanj, I.A., Jia, W.: Vertex Cover: Further observations and further improvements. Journal of Algorithms 41, 280-301 (2001)
9. Downey, R.G., Fellows, M.R.: Parameterized Complexity, Springer, Heidelberg (1999)
10. Fellows, M.R., Heggernes, P., Rosamond, F.A., Sloper, C., Telle, J.A.: Finding k disjoint triangles in an arbitrary graph. In: Hromkovič, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol. 3353, pp. 235-244. Springer, Heidelberg (2004)
11. Fellows, M.R., Hoover, M.: Perfect domination. Australian Journal of Combinatorics 3, 141-150 (1991)
12. Fomin, F.V., Thilikos, D.M.: Fast parameterized algorithms for graphs on surfaces: Linear kernel and exponential speed-up. In: Diaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 581-592. Springer, Heidelberg (2004)
13. Garey, M.R., Johnson, D.S.: The rectilinear Steiner tree problem is NP-complete. SIAM Journal on Applied Mathematics 32, 826-834 (1977)
14. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York (1979)
15. Guo, J., Niedermeier, R.: Invitation to data reduction and problem kernelization. SIGACT News 38(1), 31-45 (2007)
16. Guo, J., Niedermeier, R., Wernicke, S.: Parameterized complexity of generalized Vertex Cover problems. In: Dehne, F., López-Ortiz, A., Sack, J.-R. (eds.) WADS 2005. LNCS, vol. 3608, pp. 36-48. Springer, Heidelberg (2005) Long version to appear under the title Parameterized complexity of Vertex Cover variants in Theory of Computing Systems
17. Guo, J., Niedermeier, R., Wernicke, S.: Fixed-parameter tractability results for full-degree spanning tree and its dual. In: Fischer, K., Timm, I.J., André, E., Zhong, N. (eds.) MATES 2006. LNCS (LNAI), vol. 4196, pp. 203-214. Springer, Heidelberg (2006)
18. Lu, C.L., Tang, C.Y.: Weighted efficient domination problem on some perfect graphs. Discrete Applied Mathematics 117, 163-182 (2002)
19. Moser, H., Sikdar, S.: The parameterized complexity of the induced matching problem in planar graphs. In: Proc. 1st International Frontiers of Algorithmics Workshop (FAW 2007). LNCS, Springer, Heidelberg (2007)
20. Nemhauser, G.L., Trotter, L.E.: Vertex packing: structural properties and algorithms. Mathematical Programming 8, 232-248 (1975)
21. Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006)
22. Prieto, E.: Systematic Kernelization in FPT Algorithm Design. PhD thesis, Department of Computer Science, University of Newcastle, Australia (2005)