In recent years, significant advances have been made in the design and analysis of fully
dynamic algorithms. However, these theoretical results have received very little attention …

Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …

In recent years, significant advances have been made in the design and analysis of fully
dynamic algorithms. However, these theoretical results have received very little attention …

We present the results of an extensive computational study on dynamic algorithms for all
pairs shortest path problems. We describe our implementations of the recent dynamic …

The rectilinear Steiner minimum tree (RSMT) problem, which asks for a minimum-length
interconnection of a given set of terminals in the rectilinear plane, is one of the fundamental …

This chapter addresses several variations of the corresponding fundamental Steiner minimal
tree problem, where a given set of pins is to be connected using minimum total wirelength. It …

Dynamic tree data structures maintain forests that change over time through edge insertions
and deletions. Besides maintaining connectivity information in logarithmic time, they can …

Dynamic graph algorithms have been extensively studied in the last two decades due to
their wide applicabilityin manycon texts. Recently, several implementations and …

We report our findings on an extensive empirical study on the performance of several
algorithms for maintaining minimum spanning trees in dynamic graphs. In particular, we …

We present efficient algorithms that implement four local searches for the Steiner problem in
graphs: vertex insertion, vertex elimination, key-path exchange, and key-vertex elimination …