Arboral satisfaction: Recognition and LP approximation.

Erik D. Demaine, Varun Ganesan, Vladislav Kontsevoi,Qipeng Liu,Quanquan C. Liu,Fermi Ma,Ofir Nachum,Aaron Sidford,Erik Waingarten,Daniel Ziegler

Information Processing Letters（2017）

引用 1|浏览122

暂无评分

摘要

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ǎtrascu 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].

查看译文

关键词

Algorithms,Analysis of algorithms,Computational geometry,Data structures

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要