A Simple Algorithm for Optimal Search Trees with Two-Way Comparisons

03/01/2021
by   Marek Chrobak, et al.
0

We present a simple O(n^4)-time algorithm for computing optimal search trees with two-way comparisons. The only previous solution to this problem, by Anderson et al., has the same running time, but is significantly more complicated and is restricted to the variant where only successful queries are allowed. Our algorithm extends directly to solve the standard full variant of the problem, which also allows unsuccessful queries and for which no polynomial-time algorithm was previously known. The correctness proof of our algorithm relies on a new structural theorem for two-way-comparison search trees.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

10/10/2019

A Fast Max Flow Algorithm

In 2013, Orlin proved that the max flow problem could be solved in O(nm)...
01/12/2019

On Huang and Wong's Algorithm for Generalized Binary Split Trees

Huang and Wong [5] proposed a polynomial-time dynamic-programming algori...
04/23/2018

Generalized comparison trees for point-location problems

Let H be an arbitrary family of hyper-planes in d-dimensions. We show th...
04/26/2018

Edit Distance between Unrooted Trees in Cubic Time

Edit distance between trees is a natural generalization of the classical...
12/27/2021

Quantum Algorithm for the Longest Trail Problem

We present the quantum algorithm for the Longest Trail Problem. The prob...
09/05/2018

Multi-finger binary search trees

We study multi-finger binary search trees (BSTs), a far-reaching extensi...
02/21/2018

ARRIVAL: Next Stop in CLS

We study the computational complexity of ARRIVAL, a zero-player game on ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.