Mixed Integer Programming with Convex/Concave Constraints: Fixed-Parameter Tractability and Applications to Multicovering and Voting

09/08/2017
by   Robert Bredereck, et al.
0

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 parameter being the number of variables. We extend this result by incorporating non-decreasing piecewise linear convex or concave functions to our (mixed) integer programs. This general technique allows us to establish parameterized complexity of a number of classic computational problems. In particular, we prove that Weighted Set Multicover is in FPT when parameterized by the number of elements to cover, and that there exists an FPT-time approximation scheme for Multiset Multicover for the same parameter. Further, we use our general technique to prove that a number of problems from computational social choice (e.g., problems related to bribery and control in elections) are in FPT when parameterized by the number of candidates. For bribery, this resolves a nearly 10-year old family of open problems, and for weighted electoral control of Approval voting, this improves some previously known XP-memberships to FPT-memberships.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/07/2019

On the Parameterized Complexity of k-Edge Colouring

For every fixed integer k ≥ 1, we prove that k-Edge Colouring is fixed-p...
research
08/19/2022

A General Purpose Exact Solution Method for Mixed Integer Concave Minimization Problems

In this article, we discuss an exact algorithm for solving mixed integer...
research
01/29/2018

A Unifying Framework for Manipulation Problems

Manipulation models for electoral systems are a core research theme in s...
research
05/17/2018

Preference Elicitation and Robust Optimization with Multi-Attribute Quasi-Concave Choice Functions

Decision maker's preferences are often captured by some choice functions...
research
06/10/2021

Valued Authorization Policy Existence Problem: Theory and Experiments

Recent work has shown that many problems of satisfiability and resilienc...
research
11/06/2017

Applying Convex Integer Programming: Sum Multicoloring and Bounded Neighborhood Diversity

In the past 30 years, results regarding special classes of integer linea...
research
05/11/2021

Parameterized Algorithms for Diverse Multistage Problems

The world is rarely static – many problems need not only be solved once ...

Please sign up or login with your details

Forgot password? Click here to reset