4903 search results - page 86 / 981 » The Set Covering Machine |
91
Voted
XSYM
2005
Springer
15 years 8 months ago
2005
Springer
We propose XPathMark, an XPath benchmark on top of the XMark generated data. It consists of a set of queries which covers
101
Voted
CCCG
2007
15 years 4 months ago
2007
Given a set of unit-discs in the plane with union area A, what fraction of A can be covered by selecting a pairwise disjoint subset of the discs? Rado conjectured
108
Voted
SODA
1997
ACM
15 years 3 months ago
1997
ACM
Improving on a recent breakthrough of Sharir, we find two minimum-radius circular disks covering a planar point set, in randomized expected time O(n log2 n).
135
click to vote
ALGORITHMICA
2008
15 years 2 months ago
2008
We present exact algorithms with exponential running times for variants of n-element set cover problems, based on divide-and-conquer and on inclusion
110
Voted
ECCC
2006
15 years 2 months ago
2006
In our problem we are given a set of customers, their positions on the plane and their demands. Geometrically, the area covered by a directional antenna with parameters , ,