no code implementations • 26 Feb 2021 • Matthias Bentert, Robert Bredereck, Péter Györgyi, Andrzej Kaczmarczyk, Rolf Niedermeier
The NP-hard MATERIAL CONSUMPTION SCHEDULING Problem and closely related problems have been thoroughly studied since the 1980's.
Computer Science and Game Theory F.2.2; G.2.1; I.2.8; I.1.2
no code implementations • 3 Oct 2018 • Andrzej Kaczmarczyk, Piotr Faliszewski
From the positive perspective we provide an efficient algorithm for solving the problem parameterized by the combined parameter the number of candidates and the maximum bribery price (alternatively the number of different bribery prices).
