1158 search results - page 53 / 232 » Approximation Algorithms for the Fixed-Topology Phylogenetic... |
129
click to vote
ISSAC
2004
Springer
15 years 10 months ago
2004
Springer
A recent algorithmic procedure for computing the absolute factorization of a polynomial P(X, Y ), after a linear change of coordinates, is via a factorization modulo X3 . This was...
141
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...
114
click to vote
STOC
2002
ACM
16 years 4 months ago
2002
ACM
In this paper, we show that for several clustering problems one can extract a small set of points, so that using those core-sets enable us to perform approximate clustering effici...
159
click to vote
COCOON
2005
Springer
15 years 10 months ago
2005
Springer
For a bounded integer , we wish to color all edges of a graph G so that any two edges within distance have different colors. Such a coloring is called a distance-edge-coloring or ...
139
click to vote
TCC
2007
Springer
15 years 10 months ago
2007
Springer
Private approximation of search problems deals with finding approximate solutions to search problems while disclosing as little information as possible. The focus of this work is ...