The generalized Steiner problem (GSP) is defined as follows. We are given a graph with non-negative edge 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.
Abstract. The Generalized Steiner Problem (GSP) is de ned as follows. We are given a graph with non-negative weights and a set of pairs of vertices.
People also ask
What is the generalized Steiner problem?
What is the Steiner tree decision problem?
What is the Fermat Steiner problem?
On-line Generalized Steiner Problem (in contrast to on-line Steiner. Tree) [WY93] captures more refined communication requirements,. e.g., situations where ...
The Gen- eralized Steiner Problem (GSP) is defined as follows. We are given a graph with non-negative weights and a set of pairs of vertices.
We consider the on-line generalized Steiner problem on a general metric space. We show that a class of lazy and greedy on-line algorithms are O(√k · log k)- ...
This work considers the on-line generalized Steiner problem, in which pairs of vertices arrive on-line and are needed to be connected immediately and gives ...
The generalized Steiner problem (GSP) is defined as follows. We are given a graph with non-negative edge weights and a set of pairs of vertices.
For the Steiner tree problem (in any metric space) the competitive ratio of an on-line algorithm is the supremum, over all possible sets S, of the ratio between ...
We obtain linear upper and lower bounds for the on-line generalized Steiner problem and on-line Steiner problem on a directed graph.
Abstract— We obtain the first online algorithms for the node-weighted Steiner tree, Steiner forest and group Steiner tree problems that achieve a ...