scientific article; zbMATH DE number 6862138

DOI10.4230/LIPIcs.STACS.2017.46zbMath1402.68098arXiv1812.01852MaRDI QIDQ4636646

Matthias Mnich, Martin Koutecký, Dušan Knop

Publication date: 19 April 2018

Full work available at URL: https://arxiv.org/abs/1812.01852

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

parameterized algorithm\(n\)-fold integer programmingswap bribery

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Voting theory (91B12) Social choice (91B14)

Related Items

About the Complexity of Two-Stage Stochastic IPs ⋮ A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs ⋮ Integer programming in parameterized complexity: five miniatures ⋮ Unnamed Item ⋮ Combinatorial \(n\)-fold integer programming and applications ⋮ Faster Algorithms for Integer Programs with Block Structure ⋮ Integer Programming in Parameterized Complexity: Three Miniatures. ⋮ Robustness among multiwinner voting rules ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Mixed integer programming with convex/concave constraints: fixed-parameter tractability and applications to multicovering and voting ⋮ Scheduling meets \(n\)-fold integer programming ⋮ Unnamed Item ⋮ Parameterized resiliency problems ⋮ Complexity of shift bribery for iterative voting rules ⋮ Matrices of Optimal Tree-Depth and a Row-Invariant Parameterized Algorithm for Integer Programming ⋮ About the complexity of two-stage stochastic IPs