4903 search results - page 217 / 981 » The Set Covering Machine |
184
click to vote
DCC
2005
IEEE
16 years 5 months ago
2005
IEEE
We give an overview of some of the mathematical results of Dominique de Caen. These include a short proof of K?onig's theorem, results on Tur?an numbers, biclique partitions,...
131
click to vote
ACL
1993
15 years 7 months ago
1993
We show that feature logic extended by functional uncertainty is decidable, even if one admits cyclic descriptions. We present an algorithm, which solves feature descriptions cont...
147
click to vote
DISOPT
2006
15 years 6 months ago
2006
We propose an effective heuristic to save memory in dynamic programming on tree decompositions when solving graph optimization problems. The introduced "anchor technique"...
125
click to vote
JCT
2008
15 years 6 months ago
2008
Let be the fundamental group of a finite connected graph G. Let M be an abelian group. A distribution on the boundary of the universal covering tree is an M-valued measure defin...
169
click to vote
SIAMCOMP
2008
15 years 6 months ago
2008
We prove semi-logarithmic inapproximability for a maximization problem called unique coverage: given a collection of sets, find a subcollection that maximizes the number of elemen...