Given a set B of d-dimensional boxes (i.e., axis-aligned hyperrectangles), a minimum coverage kernel is a subset of B of minimum size covering the same region as B. Computing it is NP-hard, but as for many similar NP-hard ...

We consider the Minimum Coverage Kernel problem: given a set B of d-dimensional boxes, find a subset of B of minimum size covering the same region as B. This problem is NP -hard, but as for many NP -hard problems on graphs, ...

We introduce the p-Cable Trench problem with Covering. In this problem, p primary servers (e.g., routers) are located and a set of secondary servers (e.g., extended range WiFi antennas) is connected to each of them, to ...

Rare diseases (RDs) are a large number of diverse conditions with low individual prevalence, but collectively may affect up to 3.5-5.9% of the population. They have psychosocial and economic impact on patients and societies, ...

Nowadays, we return to live a period of lunar exploration. China, Japan and India heavily invest in missions to the moon, and then try to implement manned bases on this satellite. These bases must be installed in polar ...

Nowadays, we return to live a period of lunar exploration. China, Japan and India heavily invest in missions to the moon, and then try to implement manned bases on this satellite. These bases must be installed in polar ...

The probability of facing prison is one of the major factors that deters individual from committing crimes -- The degree of impact of this variable is affected both by the severity of penalties, and by the probability of ...