In recent years, many systems for visualizing and exploring massive amounts of data have emerged. A topic that has not yet been investigated much concerns the visualization and exploration of constraints between objects such as relationships of joint contribution to a set or mutual exclusion. In this paper, we present concepts toward visualizing mutual constraints in the well-known game of Sudo...

In this paper we show that the membership problems for finitely generated submonoids and for rational subsets are recursively equivalent for groups with two or more ends.

The unicost set covering problem is a NP-hard and it has many applications. In this paper we propose a new algorithm based on local search for solving the unicost set covering problem. A fitness function is proposed for this problem and different neighborhood relations are considered for the exploration of the neighborhood of the current solution. A new approach is introduced for effective expl...

A set V and a collection of (possibly non-disjoint) subsets are given. Also given is a real matrix describing distances between elements of V. A cover is a subset of V containing at least one representative from each subset. The multiple-choice minimum diameter problem is to select a cover of minimum diameter. The diameter is deened as the maximum distance of any pair of elements in the cover. ...

The rst contribution of this paper is a theoretical comparison of the (1+1)-EA evolutionary algorithm to other evolutionary algorithms in the case of so-called monotone reproduction operator, which indicates that the (1+1)-EA is an optimal search technique in this setting. After that we study the expected optimization time for the (1+1)-EA and show two set covering problem families where it is ...

T he recent bilingual publication of The Mathematical Writings of Évariste Galois by Peter M. Neumann [6] will make Galois’s own words available to a vast new audience of students of modern algebra. I have long advocated reading the original works of great mathematicians, but even with the advantage of Neumann’s extensively annotated transcription and translation it will be difficult for modern...