On-line Generalized Steiner Problem (1996)
| Citations: | 38 - 5 self |
BibTeX
@MISC{Awerbuch96on-linegeneralized,
author = {Baruch Awerbuch and Yossi Azar and Yair Bartal},
title = {On-line Generalized Steiner Problem},
year = {1996}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
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. Off-line generalized Steiner problem approximation algorithms were given in [AKR91, GW92]. 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 algorithm was O( p n log n) competitive [WY93]. 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(log² n) competitive algorithm based on the on-line generalized Steiner problem result.
