The generalized Steiner tree problem is defined as follows. Given a graph with non-negative weights and a set of pairs of vertices find the minimum network of edges such that each pair of vertices is in the same connected component. We present an algorithm for the on-line Generalized Steiner Tree (GST) problem, and two other problems: Rectilinear Steiner Arborescence (RSA) and Symmetric Rectilinear Steiner Arborescence (SRSA). For each of these problems we provide polynomial time algorithms with performance ratios of O(log n). The constant factors hidden in the O-notation are small, in the case of the GST, we are within factor 2 from the proven lower bound. The previous best on-line GST algorithm (Awerbuch et at. ) was O(log2 n) competitive.
|Original language||English (US)|
|Number of pages||10|
|Journal||Conference Proceedings of the Annual ACM Symposium on Theory of Computing|
|State||Published - Jan 1 1997|
|Event||Proceedings of the 1997 29th Annual ACM Symposium on Theory of Computing - El Paso, TX, USA|
Duration: May 4 1997 → May 6 1997
All Science Journal Classification (ASJC) codes