On-line generalized Steiner problem

Conference · Mon Dec 30 23:00:00 EST 1996

OSTI ID:416787

Awerbuch, B; Azar, Y; Bartal, Y ^[1]

---

1. Tel Aviv Univ. (Israel)

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{sup 2} n) competitive deterministic on-line algorithm. The previous best online algorithm (by Westbrook and Yan) was O({radical}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(log{sup 2} n) competitive algorithm based on the on-line generalized Steiner problem result.

• OSTI ID: 416787
• Report Number(s): CONF-960121--; CNN: Contract 9114440-CCR, ARPA; Contract DABT63-93-C-0038; Contract F19628-95-C-0137; Contract 5555-47
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS
ALGORITHMS
DIAGRAMS
NETWORK ANALYSIS