206 search results - page 24 / 42 » Constant factor approximation algorithm for the knapsack med... |
STACS
2009
Springer
14 years 2 months ago
2009
Springer
The notions of hypertree width and generalized hypertree width were introduced by Gottlob, Leone, and Scarcello in order to extend the concept of hypergraph acyclicity. These noti...
STOC
2003
ACM
14 years 23 days ago
2003
ACM
Given a k-uniform hypergraph, the Ek-Vertex-Cover problem is to find the smallest subset of vertices that intersects every hyperedge. We present a new multilayered PCP constructi...
COCO
2006
Springer
13 years 11 months ago
2006
Springer
We consider the problem of finding a monomial (or a term) that maximizes the agreement rate with a given set of examples over the Boolean hypercube. The problem is motivated by le...
FOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...
LATIN
2010
Springer
14 years 19 days ago
2010
Springer
In this paper we design an iterative rounding approach for the classic prize-collecting Steiner forest problem and more generally the prize-collecting survivable Steiner network de...