@inproceedings{Alstrup1997MinimizingDO,
title={Minimizing Diameters of Dynamic Trees},
author={Stephen Alstrup and Jacob Holm and K. D. Lichtenberg and M. Thorup},
booktitle={ICALP},
year={1997}
}

In this paper we consider an on-line problem related to minimizing the diameter of a dynamic tree T. A new edge f is added, and our task is to delete the edge e of the induced cycle so as to minimize the diameter of the resulting tree TU {f}{e}. Starting with a tree with n nodes, we show how each such best swap can be found in worst-case O(log2n) time. The problem was raised by Italiano and Ramaswami at ICALP'94 together with a related problem for edge deletions. Italiano and Ramaswami solved… Expand