3019 search results - page 107 / 604 » Approximating the Domatic Number |
145
click to vote
INFOCOM
2009
IEEE
15 years 11 months ago
2009
IEEE
—With the explosive deployment of “triple play” (voice, video and data services) over the same access network, guaranteeing a certain-level of survivability for the access ne...
145
click to vote
APPROX
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We consider the problem of fitting an n × n distance matrix M by a tree metric T. We give a factor O(min{n1/p , (k log n)1/p }) approximation algorithm for finding the...
129
click to vote
SDM
2007
SIAM
15 years 6 months ago
2007
SIAM
Consensus clustering has emerged as one of the principal clustering problems in the data mining community. In recent years the theoretical computer science community has generated...
143
click to vote
RECOMB
2006
Springer
16 years 5 months ago
2006
Springer
The Robinson-Foulds (RF) metric is the measure most widely used in comparing phylogenetic trees; it can be computed in linear time using Day's algorithm. When faced with the n...
142
click to vote
STOC
2004
ACM
16 years 5 months ago
2004
ACM
We establish several approximate max-integral-flow / minmulticut theorems. While in general this ratio can be very large, we prove strong approximation ratios in the case where th...