In the maximum constraint satisfaction problem (Max CSP), one is given a finite collection of (possibly weighted) constraints on overlapping sets of variables, and the goal is to ...
Vladimir G. Deineko, Peter Jonsson, Mikael Klasson...
In many real-life situations, we only have partial information about the actual probability distribution. For example, under Dempster-Shafer uncertainty, we only know the masses m...
We study the online version of the Prize-Collecting Traveling Salesman Problem (PCTSP), a generalization of the Traveling Salesman Problem (TSP). In the TSP, the salesman has to v...
Abstract—Phylogenetic networks are a generalization of phylogenetic trees that allow for the representation of non-treelike evolutionary events, like recombination, hybridization...
This paper studies a nonlinear vector precoding scheme which inverts the wireless multiple-input multiple-output (MIMO) channel at the transmitter so that simple symbol-bysymbol de...