1040 search results - page 41 / 208 » Rounding algorithms for covering problems |
156
click to vote
ICCTA
2007
IEEE
15 years 11 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...
183
click to vote
CIAC
2006
Springer
15 years 8 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...
126
click to vote
STACS
2010
Springer
16 years 2 days 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...
144
click to vote
EOR
2007
15 years 5 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 ...
161
click to vote
STOC
2010
ACM
15 years 10 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...