Many model predictive control (MPC) schemes suffer from high computational complexity. Especially robust MPC schemes, which explicitly account for the effects of disturbances, can ...
Frauke Oldewurtel, Ravi Gondhalekar, Colin Neil Jo...
Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...
In the Connected Dominating Set problem we are given as input a graph G and a positive integer k, and are asked if there is a set S of at most k vertices of G such that S is a dom...
Abstract. We consider approximating the minmax value of a multiplayer game in strategic form. Tightening recent bounds by Borgs et al., we observe that approximating the value with...
Kristoffer Arnsfelt Hansen, Thomas Dueholm Hansen,...
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...
Jianer Chen, Benny Chor, Mike Fellows, Xiuzhen Hua...