In this paper we show that iterative rounding is a powerful and flexible tool in the design of approximation algorithms for multiobjective optimization problems. We illustrate tha...
— We present a new sampling-based algorithm for iteratively locating Voronoi vertices of a point set in the unit cube Id = [0, 1]d . The algorithm takes an input sample and execu...
MAX-SAT, the optimisation variant of the satisfiability problem in propositional logic, is an important and widely studied combinatorial optimisation problem with applications in ...
For an agent to intelligently use specifications of executable protocols, it is necessary that the agent can quickly and correctly assess the outcomes of that protocol if it is ex...
Imputation of missing values is one of the major tasks for data pre-processing in many areas. Whenever imputation of data from official statistics comes into mind, several (additi...
Matthias Templ, Alexander Kowarik, Peter Filzmoser