16093 search results - page 360 / 3219 » On the optimality of the neighbor-joining algorithm |
169
click to vote
4OR
2004
15 years 6 months ago
2004
This is a summary of the most important results presented in the author's PhD thesis (Spanjaard, 2003). This thesis, written in French, was defended on 16 December 2003 and su...
300
click to vote
AUSSOIS
2001
Springer
15 years 11 months ago
2001
Springer
We discuss fast exponential time solutions for NP-complete problems. We survey known results and approaches, we provide pointers to the literature, and we discuss several open prob...
206
click to vote
COLOGNETWENTE
2010
15 years 5 months ago
2010
In this paper we analyze O’Hara’s partition bijection. We present three type of results. First, we show that O’Hara’s bijection can be viewed geometrically as a certain sci...
168
click to vote
SWAT
1994
Springer
15 years 11 months ago
1994
Springer
We give linear-time algorithms for a class of parametric search problems on weighted graphs of bounded tree-width. We also discuss the implications of our results to approximate p...
197
click to vote
FAW
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. We study a constrained version of the shortest path problem in polygonal domains, in which the path must visit a given target polygon. We provide an efficient algorithm f...