We characterize the dynamic data management problem for location based services(LBS) in mobile environments and devise a cost model for servicing both location independent and loc...
This paper presents a dynamic (or multi-period) hub location problem. It proposes a branch-and-bound algorithm that uses a Lagrangean relaxation to obtain lower and upper bounds a...
Dynamic slicing algorithms have been considered to aid in debugging for many years. However, as far as we know, no detailed studies on evaluating the benefits of using dynamic sl...
In this paper, we study the dynamic production location decisions of a manufacturer of a certain branded product. Considering brand-image as a form of goodwill, we extend the well...
Gila E. Fruchter, Eugene D. Jaffe, Israel D. Neben...
We describe an asymptotically optimal data-structure for dynamic point location for horizontal segments. For n line-segments, queries take O(log n) time, updates take O(log n) amo...