Paper by Erik D. Demaine

Erik D. Demaine, Varun Ganesan, Vladislav Kontsevoi, Qipeng Liu, Quanquan Liu, Fermi Ma, Ofir Nachum, Aaron Sidford, Erik Waingarten, and Daniel Ziegler, “Arboral satisfaction: Recognition and LP approximation”, Information Processing Letters, volume 127, November 2017, pages 1–5.

A point set P is arborally satisfied if, for any pair of points with no shared coordinates, the box they span contains another point in P. At SODA 2009, Demaine, Harmon, Iacono, Kane, and Pǎtraşcu proved a connection between the longstanding dynamic optimality conjecture about binary search trees and the problem of finding the minimum-size arborally satisfied superset of a given 2D point set [1].

We study two basic problems about arboral satisfaction. First, we develop two nontrivial algorithms to test whether a given point set is arborally satisfied. In 2D, both of our algorithms run in O(n log n) time, and one of them achieves O(n) runtime if the points are presorted; we also show a matching Ω(n log n) lower bound in the algebraic decision tree model. In d dimensions, our algorithm runs in O(d n log n + n logd - 1 n) time. Second, we study a natural integer linear programming formulation of finding the minimum-size arborally satisfied superset of a given 2D point set, which is equivalent to finding offline dynamically optimal binary search trees. Unfortunately, we conclude that the linear programming relaxation has large integrality gap, making it unlikely to find an approximation algorithm via this approach.

This paper is also available from ScienceDirect.

The paper is available in PDF (259k).
See information on file formats.
[Google Scholar search]

See also other papers by Erik Demaine.
These pages are generated automagically from a BibTeX file.
Last updated October 16, 2017 by Erik Demaine.