107 search results - page 10 / 22 » Tight Results on Minimum Entropy Set Cover |
COMPGEOM
2006
ACM
14 years 1 months ago
2006
ACM
We consider a class of geometric facility location problems in which the goal is to determine a set X of disks given by their centers (tj) and radii (rj) that cover a given set of...
DAC
1995
ACM
13 years 11 months ago
1995
ACM
In this paper we present a set cover based approach (SCP) to multi-way partitioning for minimum delay for Look-Up Table based FPGAs. SCP minimizes the number of chip-crossings on ...
VLDB
2005
ACM
14 years 1 months ago
2005
ACM
A major challenge in frequent-pattern mining is the sheer size of its mining results. In many cases, a high min sup threshold may discover only commonsense patterns but a low one ...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
Abstract—This paper addresses combinatorial optimization schemes for solving the multicriteria Steiner tree problem for communication network topology design (e.g., wireless mesh...
APPROX
2009
Springer
14 years 2 months ago
2009
Springer
The (undirected) Node Connectivity Augmentation (NCA) problem is: given a graph J = (V, EJ ) and connectivity requirements {r(u, v) : u, v ∈ V }, find a minimum size set I of n...