1040 search results - page 41 / 208 » Rounding algorithms for covering problems |
ICCTA
2007
IEEE
15 years 4 months ago
2007
IEEE
We consider the problem of finding two parallel rectangles, in arbitrary orientation, covering a given set of n points in a plane, such that the area of the larger rectangle is m...
111
click to vote
CIAC
2006
Springer
15 years 1 months ago
2006
Springer
We consider the minimum line covering problem: given a set S of n points in the plane, we want to find the smallest number l of straight lines needed to cover all n points in S. W...
STACS
2010
Springer
15 years 4 months ago
2010
Springer
Given a k-uniform hypergraph on n vertices, partitioned in k equal parts such that every hyperedge includes one vertex from each part, the k-Dimensional Matching problem asks wheth...
EOR
2007
14 years 9 months ago
2007
This paper presents a hybrid IP/CP algorithm for designing a double round robin schedule with a minimal number of breaks. Both mirrored and non-mirrored schedules with and without ...
STOC
2010
ACM
15 years 2 months ago
2010
ACM
In this paper we investigate distributed computation in dynamic networks in which the network topology changes from round to round. We consider a worst-case model in which the com...