TY - GEN

T1 - On-line generalized steiner problem

AU - Awerbuch, Baruch

AU - Azar, Yossi

AU - Bartal, Yair

N1 - Funding Information:
‘Johns Hopkins University and Lab. for Computer ence, MIT. Supported by NSF contract 9114440-CCR, ARPA/Army contract DABT63-93-C-0038, ARPA/Air Force Contract F19628-95-C-0137, and NIST/USRA Contract 5555. 47. E-Mail: baruch@cs.jhu.edu. ‘Department of Computer Science, Tel University ,Tel-Aviv 69978, Israel. Research supported part by Allon Fellowship and by the Israel Science Foundation admimistered by the Israel Academy of Sciences. E-Mail: azarQmath.tau.ac.il. *Department of Computer Science, Tel-Aviv University, Tel-Aviv 69978, Israel. Research supported in part by Ben Gu-rion Fellowship, the Ministry of Science and Arts. E-Mail: yairb@math.tau.ac.il.

PY - 1996/1/28

Y1 - 1996/1/28

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85012890650&partnerID=8YFLogxK

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85012890650

T3 - Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

SP - 68

EP - 74

BT - Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1996

PB - Association for Computing Machinery

Y2 - 28 January 1996 through 30 January 1996

ER -