Let a(n; k) denote the number of combinatorial structures of size n with k components. One often has P n;k a(n; k)x y=n! = exp yC(x) , where C(x) is frequently the exponential generating function for connected structures. How does a(n; k) behave as a function of k when n is large and C(x) is entire or has large singularities on its circle of convergence? The Flajolet-Odlyzko singularity analysi...

We consider the capacitated domination problem, which models a service-requirement assigning scenario and which is also a generalization of the dominating set problem. In this problem, we are given a graph with three parameters defined on the vertex set, which are cost, capacity, and demand. The objective of this problem is to compute a demand assignment of least cost, such that the demand of e...

We propose a method to compare semantically two natural language texts. The process is realized in two steps, the first translates the texts into description logics terminologies. The second computes the difference between the terminologies obtained. We show how the best covering problem can be used to compute the difference between two terminologies and propose a method to calculate this diffe...

The problem of covering a compact canonical polygonal region, called target region, with a finite family of rectangles is considered. Tools for mathematical modeling of the problem are provided. Especially, a function, called Γ-function, is introduced which indicates whether the rectangles with respect to their configuration form a cover of the target region or not. The construction of the Γ-fu...

In this correspondence a newcombinational algorithmfor the covering problems is proposed andcomputational experimentsareanalyzed.This algorithm enables one todetermine a set of covers associatedwith the paths of adirected rooted tree that contains atleast a mini-mal cover.

Codes with minimum distance at least d and covering radius at most d− 1 are considered. The minimal cardinality of such codes is investigated. Herewith, their connection to covering problems is applied and a new construction theorem is given. Additionally, a new lower bound for the covering problem is proved. A necessary condition on an existence problem is presented by using a multiple coverin...

We introduce a 2-factor approximation algorithm for the minimum total covering number problem.