In this paper, we will introduce an exact algorithm with a time complexity of O(1.299) for the weighted mutually exclusive set cover problem, where m is the number of subsets in the problem. This problem has important applications in recognizing mutation genes that cause different cancer diseases.

By means of a model based on a set covering formulation, it is shown how the p-Median Problem can be solved with just a column generation approach, which is embedded in a branch-and-bound framework based on dynamic reliability branching. This method is more than competitive in terms of computational times and size of the instances which have been optimally solved. In particular, problems of siz...

A matching in a graph G is a subset M of the edges of G such that no two share an endpoint. A matching has maximum cardinality if its cardinality is at least as large as that of any other matching. An odd-set cover OSC of a graph G is a labeling of the nodes of G with integers such that every edge of G is either incident to a node labeled 1 or connects two nodes labeled with the same number i ≥...

The emergence of left governments in Latin America is associated with voters’ dissatisfaction with neoliberal policy outcomes after democratic transitions. Although I believe this argument to be true, the explanations for why leftist governments behave differently are still incomplete. The main question this paper addresses is why some governments are social democratic whereas others are new-po...

V ∋vpF (V ). We assume that the qF ’s are given but pF ’s are not. Repeated evaluations of a filter yields the same state: in particular, evaluations of a filter F by two distinct algorithms yields the same V (F ). We assume filters are independent: conditioning on the complete or partial state of filters other than F does not alter the state distribution of F . Let C(F ) denote the cost of eva...

In this paper we show that the reducibility structure of several covers of sofic shifts is a flow invariant. In addition, we prove that for an irreducible subshift of almost finite type the left Krieger cover and the past set cover are reducible. We provide an example which shows that there are non almost finite type shifts which have reducible left Krieger covers. As an application we show tha...

We study the Fractional Set Cover problem in the streaming model. That is, we consider the relaxation of the set cover problem over a universe of n elements and a collection of m sets, where each set can be picked fractionally, with a value in [0, 1]. We present a randomized (1 + ε)approximation algorithm that makes p passes over the data, and uses Õ(mnO(1/pε) +n) memory space. The algorithm wo...

The Role of Mothers and Fathers in Providing Skills: Evidence from Parental Deaths This paper evaluates the long-term consequences of parental death on children’s cognitive and noncognitive skills, as well as on labor market outcomes. We exploit a large administrative data set covering many Swedish cohorts. We develop new estimation methods to tackle the potential endogeneity of death at an ear...

Uncovering and interpreting phenotype/genotype relationships are among the most challenging open questions in disease studies. Set cover approaches are explicitly designed to provide a representative set for diverse disease cases and thus are valuable in studies of heterogeneous datasets. At the same time pathway-centric methods have emerged as key approaches that significantly empower studies ...

A large number of published studies have examined the properties of either networks of citation among scientific papers or networks of coauthorship among scientists. Here, using an extensive data set covering more than a century of physics papers published in the Physical Review, we study a hybrid coauthorship/citation network that combines the two, which we analyze to gain insight into the cor...