Parameterized Resiliency Problems via Integer Linear Programming
From MaRDI portal
Publication:5283365
DOI10.1007/978-3-319-57586-5_15zbMath1486.68082arXiv1605.08738OpenAlexW2962721539WikidataQ62044467 ScholiaQ62044467MaRDI QIDQ5283365
Jason Crampton, Rémi Watrigant, Martin Koutecký, Gregory Gutin
Publication date: 21 July 2017
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1605.08738
Related Items (3)
Integer programming in parameterized complexity: five miniatures ⋮ Integer Programming in Parameterized Complexity: Three Miniatures. ⋮ Parameterized resiliency problems
Cites Work
- Unnamed Item
- Polynomial kernels for weighted problems
- Fundamentals of parameterized complexity
- Scheduling and fixed-parameter tractability
- An application of simultaneous diophantine approximation in combinatorial optimization
- Integer plane multiflows with a mixed number of demands
- 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
- A Multivariate Approach for Checking Resiliency in Access Control
- Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable
- 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
- Minkowski's Convex Body Theorem and Integer Programming
- Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree
- Parameterized Algorithms
This page was built for publication: Parameterized Resiliency Problems via Integer Linear Programming
