251 search results - page 8 / 51 » Polynomial Time Algorithms for Three-Label Point Labeling |
ARITH
2007
IEEE
14 years 1 months ago
2007
IEEE
The compensated Horner algorithm improves the accuracy of polynomial evaluation in IEEE-754 floating point arithmetic: the computed result is as accurate as if it was computed wi...
ALMOB
2008
13 years 7 months ago
2008
Background: In recent years, quartet-based phylogeny reconstruction methods have received considerable attentions in the computational biology community. Traditionally, the accura...
IWPEC
2004
Springer
14 years 27 days ago
2004
Springer
We propose to look at the computational complexity of 2-dimensional geometric optimization problems on a finite point set with respect to the number of inner points (that is, poi...
CPC
2006
13 years 7 months ago
2006
We show how to generate labeled and unlabeled outerplanar graphs with n vertices uniformly at random in polynomial time in n. To generate labeled outerplanar graphs, we present a c...
WADS
2007
Springer
14 years 1 months ago
2007
Springer
In this paper, we give a O(log copt)-approximation algorithm for the point guard problem where copt is the optimal number of guards. Our algorithm runs in time polynomial in n, the...