Abstract
Data reduction by polynomial-time preprocessing is a core concept of (parameterized) complexity analysis in solving NP-hard problems. Its practical usefulness is confirmed by experimental work. Here, generalizing and extending previous work, we present a set of data reduction preprocessing rules on the way to compute optimal dominating sets in graphs. In this way, we arrive at the novel notion of “data reduction schemes.” In addition, we obtain data reduction results for domination in directed graphs that allow to prove a linear-size problem kernel for Directed Dominating Set in planar graphs.
Supported by the Deutsche Forschungsgemeinschaft (DFG), project PEAL (parameterized complexity and exact algorithms), NI 369/1, and Emmy Noether research group PIAF (fixed-parameter algorithms), NI 369/4.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aarts, E., Lenstra, J.K. (eds.): Local Search in Combinatorial Optimization. Wiley-Interscience Series in Discrete Mathematics and Optimization (1997)
Alber, J., Betzler, N., Niedermeier, R.: Experiments on Data Reduction for Optimal Domination in Networks. To appear, Annals of Operations Research (2005)
Alber, J., Fellows, M.R., Niedermeier, R.: Polynomial Time Data Reduction for Dominating Set. Journal of the ACM 15(3), 363–384 (2004)
Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation. Springer, Heidelberg (1999)
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)
Dorn, B.: Extended Data Reduction Rules for Domination in Graphs (in German). Student Project, WSI für Informatik, Universität Tübingen, Germany (2004)
Fomin, F.V., Thilikos, D.M.: Fast Parameterized Algorithms for Graphs on Surfaces: Linear Kernel and Exponential Speed-up. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 581–592. Springer, Heidelberg (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Alber, J., Dorn, B., Niedermeier, R. (2006). A General Data Reduction Scheme for Domination in Graphs. In: Wiedermann, J., Tel, G., Pokorný, J., Bieliková, M., Štuller, J. (eds) SOFSEM 2006: Theory and Practice of Computer Science. SOFSEM 2006. Lecture Notes in Computer Science, vol 3831. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11611257_11
Download citation
DOI: https://doi.org/10.1007/11611257_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-31198-0
Online ISBN: 978-3-540-32217-7
eBook Packages: Computer ScienceComputer Science (R0)