1566 search results - page 48 / 314 » On a Cone Covering Problem |
177
click to vote
ICCTA
2007
IEEE
16 years 9 days 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...
161
click to vote
STOC
2010
ACM
15 years 10 months ago
2010
ACM
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...
195
click to vote
CIAC
2006
Springer
15 years 9 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...
171
click to vote
SIROCCO
2010
15 years 7 months ago
2010
Given a collection C of weighted subsets of a ground set E, the set cover problem is to find a minimum weight subset of C which covers all elements of E. We study a strategic game ...
135
click to vote
TWC
2008
15 years 5 months ago
2008
Multiuser downlink beamforming under quality of service (QoS) constraints has attracted considerable interest in recent years, because it is particularly appealing from a network o...