138 search results - page 4 / 28 » Approximation Algorithms for Bounded Degree Phylogenetic Roo... |
155
click to vote
CASC
2009
Springer
16 years 15 days ago
2009
Springer
This work addresses the problem of computing a certified ǫ-approximation of all real roots of a square-free integer polynomial. We proof an upper bound for its bit complexity, b...
172
click to vote
ECCC
2000
15 years 5 months ago
2000
We analyze the addition of a simple local improvement step to various known randomized approximation algorithms. Let ' 0:87856 denote the best approximation ratio currently k...
165
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
Finding the largest independent set in a graph is a notoriously difficult NP-complete combinatorial optimization problem. Moreover, even for graphs with largest degree 3, no polyn...
197
click to vote
PROPERTYTESTING
2010
15 years 3 months ago
2010
How well can the maximum size of an independent set, or the minimum size of a dominating set of a graph in which all degrees are at most d be approximated by a randomized constant...
163
click to vote
FAW
2009
Springer
16 years 14 days ago
2009
Springer
Data access time becomes the main bottleneck in applications dealing with large-scale graphs. Cache-oblivious layouts, constructed to minimize the geometric mean of arc lengths of ...