841 search results - page 33 / 169 » Approximability of Minimum AND-Circuits |
ICCS
2003
Springer
14 years 2 months ago
2003
Springer
We propose an anytime algorithm to compute successively better approximations of the optimum of Minimum Vertex Guard. Though the presentation is focused on polygons, the work may b...
ISAAC
2005
Springer
14 years 2 months ago
2005
Springer
We study the complexity and approximation of the problem of reconstructing haplotypes from genotypes on pedigrees under the Mendelian Law of Inheritance and the minimum recombinant...
WADS
2007
Springer
14 years 3 months ago
2007
Springer
Let (L, ∗) be a semilattice, and let c : L → [0, ∞) be monotone and increasing on L. We state the Minimum Join problem as: given size n sub-collection X of L and integer k w...
STACS
2007
Springer
14 years 3 months ago
2007
Springer
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...
DIS
2007
Springer
14 years 3 months ago
2007
Springer
The maximum cardinality of a frequent set as well as the minimum cardinality of an infrequent set are important characteristic numbers in frequent (item) set mining. Gunopulos et a...