4255 search results - page 47 / 851 » Cover |
119
Voted
ICALP
2005
Springer
15 years 9 months ago
2005
Springer
We reduce the approximation factor for Vertex Cover to 2 − Θ( 1√ log n ) (instead of the previous 2 − Θ(log log n log n ), obtained by Bar-Yehuda and Even [2], and by Moni...
142
Voted
ICDM
2002
IEEE
15 years 8 months ago
2002
IEEE
Mining association rules may generate a large numbers of rules making the results hard to analyze manually. Pasquier et al. have discussed the generation of GuiguesDuquenne–Luxe...
135
Voted
ICALP
2010
Springer
15 years 8 months ago
2010
Springer
Assuming the Unique Games Conjecture (UGC), we show optimal inapproximability results for two classic scheduling problems. We obtain a hardness of 2 − ε for the problem of mini...
120
click to vote
COCOON
2001
Springer
15 years 8 months ago
2001
Springer
We consider one-dimensional and multi-dimensional vector covering with variable sized bins. In the one-dimensional case, we consider variable sized bin covering with bounded item ...
111
Voted
ANTS
2000
Springer
15 years 8 months ago
2000
Springer
We shall discuss the idea of finding all rational points on a curve C by first finding an associated collection of curves whose rational points cover those of C. This classical ...