Abstract
The NP-hard Rainbow Subgraph problem, motivated from bioinformatics, is to find in an edge-colored graph a subgraph that contains each edge color exactly once and has at most \(k\) vertices. We examine the parameterized complexity of Rainbow Subgraph for paths, trees, and general graphs. We show, for example, APX-hardness even if the input graph is a properly edge-colored path in which every color occurs at most twice. Moreover, we show that Rainbow Subgraph is W[1]-hard with respect to the parameter \(k\) and also with respect to the dual parameter \(\ell :=n-k\) where \(n\) is the number of vertices. Hence, we examine parameter combinations and show, for example, a polynomial-size problem kernel for the combined parameter \(\ell \) and “maximum number of colors incident with any vertex”.
Falk Hüffner: Supported by DFG project ALEPH (HU 2139/1).
Christian Komusiewicz: Partially supported by a post-doctorial grant funded by the Région Pays de la Loire.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Alimonti, P., Kann, V.: Some APX-completeness results for cubic graphs. Theor. Comput. Sci. 237(1–2), 123–134 (2000)
Björklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Fourier meets Möbius: fast subset convolution. In: Proceedings of 39th STOC, pp. 67–74. ACM (2007)
Björklund, A., Husfeldt, T., Koivisto, M.: Set partitioning via inclusion-exclusion. SIAM J. Comput. 39(2), 546–563 (2009)
Cygan, M., Kowalik, Ł., Wykurz, M.: Exponential-time approximation of weighted set cover. Inf. Process. Lett. 109(16), 957–961 (2009)
Fernandes, R., Skiena, S.: Microarray synthesis through multiple-use PCR primer design. Bioinformatics 18(suppl 1), 128–135 (2002)
Fomin, F.V., Grandoni, F., Kratsch, D.: A measure & conquer approach for the analysis of exact algorithms. J. ACM 56(5), 25:1–25:32 (2009)
Hajiaghayi, M.T., Jain, K., Lau, L.C., Măndoiu, I.I., Russell, A., Vazirani, V.V.: Minimum multicolored subgraph problem in multiplex PCR primer set selection and population haplotyping. In: Alexandrov, V.N., van Albada, G.D., Sloot, P.M.A., Dongarra, J. (eds.) ICCS 2006. LNCS, vol. 3992, pp. 758–766. Springer, Heidelberg (2006)
Katrenič, J., Schiermeyer, I.: Improved approximation bounds for the minimum rainbow subgraph problem. Inf. Process. Lett. 111(3), 110–114 (2011)
Koch, M., Camacho, S.M., Schiermeyer, I.: Algorithmic approaches for the minimum rainbow subgraph problem. ENDM 38, 765–770 (2011)
Komusiewicz, C., Sorge, M.: Finding dense subgraphs of sparse graphs. In: Thilikos, D.M., Woeginger, G.J. (eds.) IPEC 2012. LNCS, vol. 7535, pp. 242–251. Springer, Heidelberg (2012)
Camacho, S.M., Schiermeyer, I., Tuza, Z.: Approximation algorithms for the minimum rainbow subgraph problem. Discrete Math. 310(20), 2666–2670 (2010)
Popa, A.: Better lower and upper bounds for the minimum rainbow subgraph problem. Theor. Comput. Sci. 543, 1–8 (2014)
Schiermeyer, I.: On the minimum rainbow subgraph number of a graph. Ars Mathematica Contemporanea 6(1), 83–88 (2012)
Williamson, D.P., Shmoys, D.B.: The Design of Approximation Algorithms. Cambridge University Press, New York (2011)
Acknowledgments
We thank the reviewers of WG’ 14 for their thorough and valuable feedback.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Hüffner, F., Komusiewicz, C., Niedermeier, R., Rötzschke, M. (2014). The Parameterized Complexity of the Rainbow Subgraph Problem. In: Kratsch, D., Todinca, I. (eds) Graph-Theoretic Concepts in Computer Science. WG 2014. Lecture Notes in Computer Science, vol 8747. Springer, Cham. https://doi.org/10.1007/978-3-319-12340-0_24
Download citation
DOI: https://doi.org/10.1007/978-3-319-12340-0_24
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-12339-4
Online ISBN: 978-3-319-12340-0
eBook Packages: Computer ScienceComputer Science (R0)