Abstract
In the weighted ancestor problem one preprocesses a weighted tree (the weights are on the nodes and increase with tree depth) to support predecessor queries, which are called weighted ancestors queries, on the paths from the query node to the root. Since, the weighted ancestor problem appears in numerous applications, the problem has been studied and solutions for static trees are well known. However, it has been an open question whether this can be solved optimally for the dynamic version of the problem, where node insertions are supported. Node insertions are leaf insertions or edge splittings. In this paper we present a solution for the dynamic weighted ancestors problem which supports queries and update operations in the same time bounds as those for dynamic predecessor structures.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007 |
| Publisher | Association for Computing Machinery |
| Pages | 565-574 |
| Number of pages | 10 |
| ISBN (Electronic) | 9780898716245 |
| State | Published - 2007 |
| Event | 18th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007 - New Orleans, United States Duration: 7 Jan 2007 → 9 Jan 2007 |
Publication series
| Name | Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms |
|---|---|
| Volume | 07-09-January-2007 |
Conference
| Conference | 18th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007 |
|---|---|
| Country/Territory | United States |
| City | New Orleans |
| Period | 7/01/07 → 9/01/07 |
Bibliographical note
Publisher Copyright:Copyright © 2007 by the Association for Computing Machinery, Inc. and the Society for Industrial and Applied Mathematics.