We study graph orientations that minimize the entropy of the in-degree sequence. The problem of finding such an orientation is an interesting special case of the minimum entropy ...
Abstract. A classical problem in query optimization is to find the optimal ordering of a set of possibly correlated selections. We provide an ion of this problem as a generalizati...
In this paper, we study the following disc covering problem: Given a set of discs of various radii on the plane, find a subset of discs to maximize the area covered by exactly on...
— Recently it has been proved that the (1+1)-EA produces poor worst-case approximations for the vertex cover problem. In this paper the result is extended to the (1+λ)-EA by pro...
Consider the symmetric group Sn equipped with the Hamming metric dH . Packing and covering problems in the finite metric space (Sn, dH ) are surveyed, including a combination of b...