Parameterized resiliency problems
DOI10.1016/j.tcs.2019.08.002zbMath1434.68206OpenAlexW2965757790MaRDI QIDQ2330129
Gregory Gutin, Rémi Watrigant, Martin Koutecký, Jason Crampton
Publication date: 18 October 2019
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2019.08.002
social choice theorycomputational biologyfixed-parameter tractabilityaccess controlclosest string problemparametric integer linear programmingdisjoint set coverresiliency problems
Integer programming (90C10) Sensitivity, stability, parametric optimization (90C31) Social choice (91B14) Parameterized complexity, tractability and kernelization (68Q27)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Polynomial kernels for weighted problems
- Fundamentals of parameterized complexity
- On covering problems of codes
- Scheduling and fixed-parameter tractability
- An application of simultaneous diophantine approximation in combinatorial optimization
- Integer plane multiflows with a mixed number of demands
- Decomposition of test sets in stochastic integer programming
- Fixed-parameter algorithms for CLOSEST STRING and related problems
- Multivariate complexity analysis of Swap Bribery
- Bin packing with fixed number of bins revisited
- \(n\)-fold integer programming in cubic time
- Theory of computation.
- A Multivariate Approach for Checking Resiliency in Access Control
- What’s Next? Future Directions in Parameterized Complexity
- Integer Programming with a Fixed Number of Variables
- Parametric Integer Programming in Fixed Dimension
- Elections with Few Candidates: Prices, Weights, and Covering Problems
- A Structural Approach to Kernels for ILPs: Treewidth and Total Unimodularity
- Swap Bribery
- Minkowski's Convex Body Theorem and Integer Programming
- Complexity of short Presburger arithmetic
- Control and Bribery in Voting
- Parameterized Resiliency Problems via Integer Linear Programming
- Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree
- Parameterized Algorithms
- Scheduling
This page was built for publication: Parameterized resiliency problems
