We show that the survivable bottleneck Steiner tree problem in normed planes can be solved in polynomial time when the number of Steiner points is constant. This is a fundamental problem in wireless ad-hoc network design where the objective is to design networks with efficient routing topologies. Our result holds for a general definition of survivability and for any norm whose ball is specified...

We study the computational complexity of finding stable outcomes in symmetric additively-separable hedonic games. These coalition formation games are specified by an undirected edge-weighted graph: nodes are players, an outcome of the game is a partition of the nodes into coalitions, and the utility of a node is the sum of incident edge weights in the same coalition. We consider several natural...

Sanitation in neighbourhood and household domains can provide primary protection against diarrhea morbidity, yet their distinct health benefits have not been succinctly distinguished and reviewed. We present here the first systematic review and meta-analysis of the distinct effect of neighbourhood and household sanitation conditions on diarrhea morbidity. We identified studies reporting the eff...

Variable or value elimination in a constraint satisfaction problem (CSP) can be used in preprocessing or during search to reduce search space size. A variable elimination rule (value elimination rule) allows the polynomial-time identification of certain variables (domain elements) whose elimination, without the introduction of extra compensatory constraints, does not affect the satisfiability o...

Elimination of inconsistent values in instances of the constraint satisfaction problem (CSP) conserves all solutions. Elimination of substitutable values conserves at least one solution. We show that certain values which are neither inconsistent nor substitutable can also be deleted while conserving at least one solution. This allows us to state novel rules for the elimination of values in a bi...

In this paper, we propose a novel nonparametric approach to reconstruction of three-dimensional (3D) objects from 2D blurred and noisy observations which is a problem of computational optical sectioning. This approach is based on an approximate image formation model which takes into account depth varying nature of blur described by a matrix of shift-invariant 2D point-spread functions (PSF ) of...

We consider a special kind of non-deterministic Turing machines. Cluster machines are distinguished by a neighbourhood relationship between accepting paths. Based on a formalization using equivalence relations some subtle properties of these machines are proven. Moreover, by abstraction we gain the machine-independend concept of cluster sets which is the starting point to establish cluster oper...