23 search results - page 1 / 5 » Approximating Min Sum Set Cover |
SODA
2010
ACM
14 years 2 months ago
2010
ACM
ALGORITHMICA
2004
13 years 4 months ago
2004
STACS
2012
Springer
12 years 15 days ago
2012
Springer
JGAA
2006
13 years 4 months ago
2006
We consider two problems, namely Min Split-coloring and Min Cocoloring, that generalize the classical Min Coloring problem by using not only stable sets but also cliques to cover ...
EOR
2010
13 years 5 months ago
2010
Traditionally, clustering problems are investigated under the assumption that all objects must be clustered. A shortcoming of this formulation is that a few distant objects, calle...