Parameterized resiliency problems

Abstract We introduce an extension of decision problems called resiliency problems. In a resiliency problem, the goal is to decide whether an instance remains positive after any (appropriately defined) perturbation has been applied to it. To tackle these kinds of problems, some of which might be of practical interest, we introduce a notion of resiliency for Integer Linear Programs (ILP) and show how to use a result of Eisenbrand and Shmonin (Math. Oper. Res., 2008) on Parametric Linear Programming to prove that ILP Resiliency is fixed-parameter tractable (FPT) under a certain parameterization. To demonstrate the utility of our result, we consider natural resiliency variants of several concrete problems, and prove that they are FPT under natural parameterizations. Our first results concern a four-variate problem which generalizes the Disjoint Set Cover problem and which is of interest in access control. We obtain a complete parameterized complexity classification for every possible combination of the parameters. Then, we introduce and study a resiliency variant of the Closest String problem, for which we extend an FPT result of Gramm et al. (Algorithmica, 2003). We also consider problems in the fields of scheduling and social choice. We believe that many other problems can be tackled by our framework.

[1]  Ravi Kannan.  Test Sets for Integer Programs, 0_ Sentences , 1990, Polyhedral Combinatorics.

[2]  Gregory Gutin,et al.  A Multivariate Approach for Checking Resiliency in Access Control , 2016, AAIM.

[3]  David Martin,et al.  Computational Molecular Biology: An Algorithmic Approach , 2001 .

[4]  András Frank,et al.  An application of simultaneous diophantine approximation in combinatorial optimization , 1987, Comb..

[5]  Friedrich Eisenbrand,et al.  Parametric Integer Programming in Fixed Dimension , 2008, Math. Oper. Res..

[6]  Matthias Mnich,et al.  Scheduling and fixed-parameter tractability , 2015, Math. Program..

[7]  A. Litman,et al.  On covering problems of codes , 1997, Theory of Computing Systems.

[8]  Rahul Vaze,et al.  Optimally Approximating the Coverage Lifetime of Wireless Sensor Networks , 2013, IEEE/ACM Transactions on Networking.

[9]  Igor Pak,et al.  Complexity of short Presburger arithmetic , 2017, STOC.

[10]  P. Faliszewski,et al.  Control and Bribery in Voting , 2016, Handbook of Computational Social Choice.

[11]  Michael R. Fellows,et al.  Fundamentals of Parameterized Complexity , 2013 .

[12]  Gregory Gutin,et al.  Parameterized Resiliency Problems via Integer Linear Programming , 2017, CIAC.

[13]  Bin Ma,et al.  Distinguishing string selection problems , 2003, SODA '99.

[14]  Rahul Vaze,et al.  The online disjoint set cover problem and its applications , 2015, 2015 IEEE Conference on Computer Communications (INFOCOM).

[15]  Piotr Faliszewski,et al.  Swap Bribery , 2009, SAGT.

[16]  Martin Koutecký,et al.  A Unifying Framework for Manipulation Problems , 2018, AAMAS.

[17]  Dániel Marx,et al.  What's Next? Future Directions in Parameterized Complexity , 2012, The Multivariate Algorithmic Revolution and Beyond.

[18]  Dexter Kozen.  Theory of Computation , 2006, Texts in Computer Science.

[19]  Raymond Hemmecke,et al.  n-Fold integer programming in cubic time , 2011, Math. Program..

[20]  Martin Koutecký,et al.  Combinatorial n-fold integer programming and applications , 2017, Mathematical Programming.

[21]  Mohammad Taghi Hajiaghayi,et al.  Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable , 2010, TALG.

[22]  Yuichi Asahiro,et al.  Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree , 2007, AAIM.

[23]  Stefan Kratsch,et al.  Polynomial kernels for weighted problems , 2015, J. Comput. Syst. Sci..

[24]  Michal Pilipczuk,et al.  Parameterized Algorithms , 2015, Springer International Publishing.

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

[26]  Raymond Hemmecke,et al.  Graver basis and proximity techniques for block-structured separable convex integer minimization problems , 2012, Mathematical Programming.

[27]  Derick Wood,et al.  Theory of computation , 1986 .

[28]  Gregory Gutin,et al.  Resiliency Policies in Access Control Revisited , 2016, SACMAT.

[29]  András Sebő.  Integer plane multiflows with a fixed number of demands , 1993 .

[30]  Piotr Faliszewski,et al.  Elections with Few Candidates: Prices, Weights, and Covering Problems , 2015, ADT.

[31]  Ildikó Schlotter,et al.  Multivariate Complexity Analysis of Swap Bribery , 2010, Algorithmica.

[32]  Stefan Kratsch,et al.  A Structural Approach to Kernels for ILPs: Treewidth and Total Unimodularity , 2015, ESA.

[33]  Hendrik W. Lenstra,et al.  Integer Programming with a Fixed Number of Variables , 1983, Math. Oper. Res..

[34]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[35]  Raymond Hemmecke,et al.  Decomposition of test sets in stochastic integer programming , 2003, Math. Program..

[36]  Daniel Lokshtanov,et al.  Parameterized Integer Quadratic Programming: Variables and Coefficients , 2015, ArXiv.

[37]  Ronald V. Book,et al.  Review: Michael R. Garey and David S. Johnson, Computers and intractability: A guide to the theory of $NP$-completeness , 1980 .

[38]  Klaus Jansen,et al.  Bin packing with fixed number of bins revisited , 2013, J. Comput. Syst. Sci..

[39]  Ravi Kannan,et al.  Minkowski's Convex Body Theorem and Integer Programming , 1987, Math. Oper. Res..

[40]  Igor Pak,et al.  Short Presburger Arithmetic Is Hard , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).

[41]  Ninghui Li,et al.  Resiliency Policies in Access Control , 2009, TSEC.

[42]  Rolf Niedermeier,et al.  Fixed-Parameter Algorithms for CLOSEST STRING and Related Problems , 2003, Algorithmica.