107 search results - page 7 / 22 » Tight Results on Minimum Entropy Set Cover |
ICALP
2011
Springer
13 years 2 days ago
2011
Springer
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
APPROX
2007
Springer
14 years 2 months ago
2007
Springer
We investigate the problem of computing a minimum set of solutions that approximates within a specified accuracy the Pareto curve of a multiobjective optimization problem. We show...
IPPS
2005
IEEE
14 years 2 months ago
2005
IEEE
: A fundamental problem in communication networks is wavelength assignment (WA): given a set of routing paths on a network, assign a wavelength to each path such that the paths wit...
CORR
2011
Springer
13 years 3 months ago
2011
Springer
We describe a new variational lower-bound on the minimum energy configuration of a planar binary Markov Random Field (MRF). Our method is based on adding auxiliary nodes to every...
DM
2002
13 years 8 months ago
2002
Let G be a tree and let H be a collection of subgraphs of G, each having at most d connected components. Let (H) denote the maximum number of members of H no two of which share a ...