Sciweavers

3 search results - page 1 / 1
» Maintaining Center and Median in Dynamic Trees
Sort
View
SWAT
2000
Springer
114views Algorithms» more  SWAT 2000»
13 years 8 months ago
Maintaining Center and Median in Dynamic Trees
Abstract. We show how to maintain centers and medians for a collection of dynamic trees where edges may be inserted and deleted and node and edge weights may be changed. All update...
Stephen Alstrup, Jacob Holm, Mikkel Thorup
NSDI
2010
13 years 6 months ago
ElasticTree: Saving Energy in Data Center Networks
Networks are a shared resource connecting critical IT infrastructure, and the general practice is to always leave them on. Yet, meaningful energy savings can result from improving...
Brandon Heller, Srinivasan Seetharaman, Priya Maha...
TALG
2008
131views more  TALG 2008»
13 years 4 months ago
Kinetic and dynamic data structures for closest pair and all nearest neighbors
We present simple, fully dynamic and kinetic data structures, which are variants of a dynamic two-dimensional range tree, for maintaining the closest pair and all nearest neighbors...
Pankaj K. Agarwal, Haim Kaplan, Micha Sharir