1433 search results - page 28 / 287 » On Covering Problems of Rado |
169
click to vote
COMPGEOM
2004
ACM
16 years 10 hour ago
2004
ACM
Let P be a set of n points in general position in the plane. Let Xk(P ) denote the number of empty convex k-gons determined by P. We derive, using elementary proof techniques, sev...
152
click to vote
ENDM
2007
15 years 6 months ago
2007
For a given positive integer k, sr(m, k) denotes the minimal positive integer such that every coloring of [n], n ≥ sr(m, k), that uses each color at most k times, yields a rainb...
163
click to vote
WEA
2007
Springer
16 years 20 days ago
2007
Springer
Abstract. The vertex cover problem is a classical NP-complete problem for which the best worst-case approximation ratio is 2− o(1). In this paper, we use a collection of simple g...
171
Voted
CCCG
2001
15 years 8 months ago
2001
We investigate the following translational 2D polygon covering problem: for a collection of covering polygons and a target point (or polygon) set, decide if the covering polygons ...
200
click to vote
APPROX
2008
Springer
15 years 8 months ago
2008
Springer
We consider the variant of the minimum vertex cover problem in which we require that the cover induces a connected subgraph. We give new approximation results for this problem in d...