We investigate the following question: “Given an intersecting multi-hypergraph on n points, what fraction of edges must be covered by any of the best 2 points?” (Here “best...
In this paper we consider both the maximization variant Max Rep and the minimization variant Min Rep of the famous Label Cover problem, for which, till now, the best approximation ...
Moses Charikar, MohammadTaghi Hajiaghayi, Howard J...
It is shown that the Hilbert series of the face ring of a clique complex (equivalently, flag complex) of a graph G is, up to a factor, just a specialization of SG (x, y), the subg...
Given a graph (directed or undirected) with costs on the edges, and an integer k, we consider the problem of nding a k-node connected spanning subgraph of minimum cost. For the ge...
We give a general framework for the problem of finding all minimal hitting sets of a family of objects in Rd by another. We apply this framework to the following problems: (i) hit...