Persistence, Offline Algorithms, and Space Compaction (1991)
by
David Eppstein
BibTeX
@MISC{Eppstein91persistence,offline,
author = {David Eppstein},
title = {Persistence, Offline Algorithms, and Space Compaction},
year = {1991}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We consider dynamic data structures in which updates rebuild a static solution. Space bounds for persistent versions of these structures can often be reduced by using an offline persistent data structure in place of the static solution. We apply this technique to decomposable search problems, to dynamic linear programming, and to maintaining the minimum spanning tree in a dynamic graph. Our algorithms admit trade-offs of update time vs. query time, and of time vs. space.
