On-line generalized steiner problem

Baruch Awerbuch, Yossi Azar, Yair Bartal

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


The Generalized Steiner Problem (GSP) is defined as follows. We are given a graph with non-negative weights and a set of pairs of vertices. The algorithm has to construct minimum weight subgraph such that the two nodes of each pair are connected by a path. We consider the on-line generalized Steiner problem, in which pairs of vertices arrive on-line and are needed to be connected immediately. We give a simple O(log n) competitive deterministic on-line algorithm. The previous best online algorithm (by Westbrook and Yan) was O(√n log n) competitive. We also consider the network connectivity leasing problem which is a generalization of the GSP. Here edges of the graph can be either bought or leased for different costs. We provide simple randomized O(log2 n) competitive algorithm based on the on-line generalized Steiner problem result.

Original languageEnglish
Title of host publicationProceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1996
PublisherAssociation for Computing Machinery
Number of pages7
ISBN (Electronic)0898713668
StatePublished - 28 Jan 1996
Event7th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1996 - Atlanta, United States
Duration: 28 Jan 199630 Jan 1996

Publication series

NameProceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
VolumePart F129447


Conference7th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1996
Country/TerritoryUnited States


Dive into the research topics of 'On-line generalized steiner problem'. Together they form a unique fingerprint.

Cite this