Voting and bribing in single-exponential time
We introduce a general problem about bribery in voting systems. In the R-Multi-Bribery
problem, the goal is to bribe a set of voters at minimum cost such that a desired candidate is …
problem, the goal is to bribe a set of voters at minimum cost such that a desired candidate is …
Near-Linear Time Algorithm for -Fold ILPs via Color Coding
We study an important case of integer linear programs (ILPs) of the form \max{c^Tx\vert\
mathcalAx=b,l≦x≦u,\,x∈Z^nt\} with nt variables and lower and upper bounds …
mathcalAx=b,l≦x≦u,\,x∈Z^nt\} with nt variables and lower and upper bounds …
[HTML][HTML] Integer programming in parameterized complexity: Five miniatures
Powerful results from the theory of integer programming have recently led to substantial
advances in parameterized complexity. However, our perception is that, except for Lenstra's …
advances in parameterized complexity. However, our perception is that, except for Lenstra's …
High-multiplicity N-fold IP via configuration LP
N-fold integer programs (IPs) form an important class of block-structured IPs for which
increasingly fast algorithms have recently been developed and successfully applied. We …
increasingly fast algorithms have recently been developed and successfully applied. We …
[HTML][HTML] Mixed integer programming with convex/concave constraints: Fixed-parameter tractability and applications to multicovering and voting
A classic result of Lenstra [Math. Oper. Res. 1983] says that an integer linear program can
be solved in fixed-parameter tractable (FPT) time for the parameterization by the number of …
be solved in fixed-parameter tractable (FPT) time for the parameterization by the number of …
New bounds on augmenting steps of block-structured integer programs
We consider 4-block $ n $-fold integer programs, whose constraint matrix consists of $ n $
copies of small matrices $ A $, $ B $, and $ D $, and one copy of $ C $, in a specific block …
copies of small matrices $ A $, $ B $, and $ D $, and one copy of $ C $, in a specific block …
Integer programming in parameterized complexity: Three miniatures
Powerful results from the theory of integer programming have recently led to substantial
advances in parameterized complexity. However, our perception is that, except for Lenstra's …
advances in parameterized complexity. However, our perception is that, except for Lenstra's …
Integer programming and incidence treedepth
Recently a strong connection has been shown between the tractability of integer
programming (IP) with bounded coefficients on the one side and the structure of its …
programming (IP) with bounded coefficients on the one side and the structure of its …
FPT algorithms for a special block-structured integer program with applications in scheduling
In this paper, a special case of the generalized 4-block n-fold IPs is investigated, where B i=
B and B has a rank at most 1. Such IPs, called almost combinatorial 4-block n-fold IPs …
B and B has a rank at most 1. Such IPs, called almost combinatorial 4-block n-fold IPs …
Equitable Connected Partition and Structural Parameters Revisited: N-fold Beats Lenstra
V Blažej, D Knop, J Pokorný, Š Schierreich - arXiv preprint arXiv …, 2024 - arxiv.org
We study the Equitable Connected Partition (ECP for short) problem, where we are given a
graph G=(V, E) together with an integer p, and our goal is to find a partition of V into p parts …
graph G=(V, E) together with an integer p, and our goal is to find a partition of V into p parts …