Parameterized Complexity of Cardinality Constrained Optimization Problems

We study the parameterized complexity of cardinality constrained optimization problems, i.e. optimization problems that require their solutions to contain specified numbers of elements to optimize solution values. For this purpose, we consider around 20 such optimization problems, as well as their parametric duals, that deal with various fundamental relations among vertices and edges in graphs. We have almost completely settled their parameterized complexity by giving either FPT algorithms or W[1]-hardness proofs. Furthermore, we obtain faster exact algorithms for several cardinality constrained optimization problems by transforming them into problems of finding maximum (minimum) weight triangles in weighted graphs.

[1]  Don Coppersmith,et al.  Matrix multiplication via arithmetic progressions , 1987, STOC.

[2]  Svatopluk Poljak,et al.  On the complexity of the subgraph problem , 1985 .

[3]  Michael R. Fellows,et al.  Cutting Up is Hard to Do: the Parameterized Complexity of k-Cut and Related Problems , 2003, CATS.

[4]  Refael Hassin,et al.  Complexity of finding dense subgraphs , 2002, Discret. Appl. Math..

[5]  Francesco Maffioli,et al.  An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints , 2006, Discret. Appl. Math..

[6]  Mam Riess Jones.  Color Coding , 1962, Human factors.

[7]  Kathryn Fraughnaugh,et al.  Introduction to graph theory , 1973, Mathematical Gazette.

[8]  Michael R. Fellows,et al.  Parameterized Complexity , 1998 .

[9]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[10]  Leizhen Cai,et al.  Random Separation: A New Method for Solving Fixed-Cardinality Optimization Problems , 2006, IWPEC.

[11]  Ge Xia,et al.  Improved Parameterized Upper Bounds for Vertex Cover , 2006, MFCS.

[12]  Aravind Srinivasan,et al.  Splitters and near-optimal derandomization , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[13]  Michael Langberg,et al.  Approximation Algorithms for Maximization Problems Arising in Graph Partitioning , 2001, J. Algorithms.

[14]  Bruce A. Reed,et al.  Finding odd cycle transversals , 2004, Oper. Res. Lett..

[15]  Fred B. Schneider,et al.  A Theory of Graphs , 1993 .

[16]  Noga Alon,et al.  On the Exponent of the All Pairs Shortest Path Problem , 1991, J. Comput. Syst. Sci..

[17]  Jörg Flum,et al.  Parameterized Complexity Theory , 2006, Texts in Theoretical Computer Science. An EATCS Series.

[18]  Dániel Marx,et al.  Parameterized graph separation problems , 2004, Theor. Comput. Sci..

[19]  Michael R. Fellows,et al.  Fixed-Parameter Tractability and Completeness II: On Completeness for W[1] , 1995, Theor. Comput. Sci..

[20]  Éva Tardos,et al.  Algorithm design , 2005 .

[21]  Silvio Micali,et al.  An O(v|v| c |E|) algoithm for finding maximum matching in general graphs , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).