138 search results - page 2 / 28 » Approximation Algorithms for Bounded Degree Phylogenetic Roo... |
ANTS
2008
Springer
13 years 7 months ago
2008
Springer
We enumerate all totally real number fields F with root discriminant F 14. There are 1229 such fields, each with degree [F : Q] 9. In this article, we consider the following prob...
SODA
2012
ACM
11 years 7 months ago
2012
ACM
The Directed Steiner Tree (DST) problem is a cornerstone problem in network design. We focus on the generalization of the problem with higher connectivity requirements. The proble...
APPROX
2006
Springer
13 years 9 months ago
2006
Springer
WSC
2004
13 years 6 months ago
2004
The stochastic root-finding problem (SRFP) is that of solving a system of q equations in q unknowns using only an oracle that provides estimates of the function values. This paper...
IPPS
1999
IEEE
13 years 9 months ago
1999
IEEE
A binary-tree algorithm, Bin(n), proceeds level-bylevel from the leaves of a 2n -leaf balanced binary tree to its root. This paper deals with running binary-tree algorithms on mul...