Haim Kaplan, Tova Milo, Ronen Shabo
comparison of labeling schemes for ancestor queries
On the price of stability for designing undirected networks with fair cost allocations (2006)
Amos Fiat, Haim Kaplan, Meital Levy, Svetlana Olonetsky, Ronen Shabo
Abstract. In this paper we address the open problem of bounding the price of stability for network design with fair cost allocation for undirected graphs posed in [1]. For the version of this problem...
Compact labeling schemes for ancestor queries (2001)
Haim Kaplan, Tova Milo, Ronen Shabo
Motivated by a recent application in XML search engines we study the problem of labeling the nodes of a tree (XML file) such that given the labels of two nodes one can determine whether one node is...
A Comparison of Labeling Schemes for Ancestor Queries (2001)
Haim Kaplan, Tova Milo, Ronen Shabo
XML documents are often viewed as trees (basically the parse tree of the document), and queries over such documents typically test for ancestor relationships among tree nodes. Search engines process...