1424 search results - page 35 / 285 » The Multi-radius Cover Problem |
110
Voted
FPL
1997
Springer
15 years 4 months ago
1997
Springer
Technology mapping can be viewed as the optimization problem of finding a minimum cost cover of the given Boolean network by choosing from given library of logic cells. The core of...
108
Voted
ICCTA
2007
IEEE
15 years 7 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...
100
Voted
STOC
2010
ACM
15 years 5 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...
134
Voted
CIAC
2006
Springer
15 years 4 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...
125
Voted
SIROCCO
2010
15 years 2 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 ...