The Parameterized Complexity of Some Minimum Label Problems
We study the parameterized complexity of several minimum label graph problems, in which we are given an undirected graph whose edges are labeled, and a property Π, and we are asked to find a subset of edges satisfying property Π that uses the minimum number of labels. These problems have a lot of applications in networking. We show that all the problems under consideration are W-hard when parameterized by the number of used labels, and that they remain W-hard even on graphs whose pathwidth is bounded above by a small constant. On the positive side, we prove that most of these problems are FPT when parameterized by the solution size, that is, the size of the sought edge set. For example, we show that computing a maximum matching or an edge dominating set that uses the minimum number of labels, is FPT when parameterized by the solution size. Proving that some of these problems are FPT is nontrivial, and requires interesting and elegant algorithmic methods that we develop in this paper.
KeywordsBipartite Graph Partial Solution Parameterized Complexity Edge Incident Span Tree Problem
Unable to display preview. Download preview PDF.
- 4.Carr, R., Doddi, S., Konjevod, G., Marathe, M.: On the red-blue set cover problem. In: Proc. 11th ACM-SIAM SODA, pp. 345–353 (2000)Google Scholar
- 7.Downey, R.G., Fellows, M.R.: Parameterized complexity. Monographs in Computer Science. Springer, New York (1999)Google Scholar
- 9.Jha, S., Sheyner, O., Wing, J.: Two formal analyses of attack graphs. In: Proc. 15th IEEE Computer Security Foundations Workshop, pp. 49–63 (2002)Google Scholar
- 12.Uno, T.: Algorithms for enumerating all perfect, maximum and maximal matchings in bipartite graphs. In: Leong, H.-V., Jain, S., Imai, H. (eds.) ISAAC 1997. LNCS, vol. 1350, pp. 92–101. Springer, Heidelberg (1997)Google Scholar
- 13.Voss, S., Cerulli, R., Fink, A., Gentili, M.: Applications of the pilot method to hard modifications of the minimum spanning tree problem. In: Proc. 18th MINI EURO Conference on VNS (2005)Google Scholar
- 16.Wirth, H.: Multicriteria Approximation of Network Design and Network Upgrade Problems. PhD thesis, Department of Computer Science, Universität Würzburg, Germany (2005)Google Scholar
- 17.Xiong, Y.: The Minimum Labeling Spanning Tree Problem and Some Variants. PhD thesis, Graduate School of the University of Maryland, USA (2005)Google Scholar
- 20.Zhang, P., Tang, L., Zhao, W., Cai, J., Li, A.: Approximation and hardness results for label cut and related problems (manuscript) (2007)Google Scholar