: Phylogenetic search is a key tool used in a variety of biological research endeavors. However, this search problem is known to be computationally difficult, due to the astronomic...
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
Abstract. The search tree size of the spatial Branch-and-Bound algorithm for Mixed-Integer Nonlinear Programming depends on many factors, one of which is the width of the variable ...
Pietro Belotti, Sonia Cafieri, Jon Lee, Leo Libert...
The adaptation of software technology to distributed environments is an important challenge today. In this work we combine parallel and distributed search. By this way we add the ...
We present a new finger search tree with O(1) worst-case update time and O(log log d) expected search time with high probability in the Random Access Machine (RAM) model of comput...
Alexis C. Kaporis, Christos Makris, Spyros Sioutas...