1433 search results - page 48 / 287 » On Covering Problems of Rado |
STOC
1999
ACM
15 years 4 months ago
1999
ACM
We give an O( log n) factor approximation algorithm for covering a rectilinear polygon with holes using axis-parallel rectangles. This is the first polynomial time approximation a...
ICALP
2010
Springer
15 years 4 months ago
2010
Springer
Computing a minimum vertex cover in graphs and hypergraphs is a well-studied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex c...
103
click to vote
STOC
2003
ACM
15 years 5 months 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...
PODC
2005
ACM
15 years 5 months ago
2005
ACM
In this paper we consider the weighted, capacitated vertex cover problem with hard capacities (capVC). Here, we are given an undirected graph G = (V, E), non-negative vertex weigh...
ICPR
2006
IEEE
16 years 28 days ago
2006
IEEE
In this paper we present a minimum sphere covering approach to pattern classification that seeks to construct a minimum number of spheres to represent the training data and formul...