Results 1  10
of
1,332
Solving group Steiner problems as Steiner Problems
, 2004
"... The generalized spanning tree or group Steiner problem (GSP) is a generalization of the Steiner problem in graphs (SPG): one requires a tree spanning (at least) one vertex of each subset, given in a family of vertex subsets, while minimizing the sum of the corresponding edge costs. Specialized solut ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
The generalized spanning tree or group Steiner problem (GSP) is a generalization of the Steiner problem in graphs (SPG): one requires a tree spanning (at least) one vertex of each subset, given in a family of vertex subsets, while minimizing the sum of the corresponding edge costs. Specialized
On the covering Steiner problem
 Theory Comput
"... Abstract. The Covering Steiner problem is a common generalization of the kMST and Group Steiner problems. An instance of the Covering Steiner problem consists of an undirected graph with edgecosts, and some subsets of vertices called groups, with each group being equipped with a nonnegative integ ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
Abstract. The Covering Steiner problem is a common generalization of the kMST and Group Steiner problems. An instance of the Covering Steiner problem consists of an undirected graph with edgecosts, and some subsets of vertices called groups, with each group being equipped with a non
On Reductions for the Steiner Problem in Graphs
, 1999
"... Several authors have demonstrated the use of reductions in order to decrease the difficulty of solving the Steiner Problem in Graphs. This paper develops the theory of confluence as it relates to graph reduction, and uses this theory to gain insights into how the maximum amount of reduction can be o ..."
Abstract
 Add to MetaCart
Several authors have demonstrated the use of reductions in order to decrease the difficulty of solving the Steiner Problem in Graphs. This paper develops the theory of confluence as it relates to graph reduction, and uses this theory to gain insights into how the maximum amount of reduction can
Approximation Algorithms for Directed Steiner Problems
 Journal of Algorithms
, 1998
"... We give the first nontrivial approximation algorithms for the Steiner tree problem and the generalized Steiner network problem on general directed graphs. These problems have several applications in network design and multicast routing. For both problems, the best ratios known before our work we ..."
Abstract

Cited by 178 (8 self)
 Add to MetaCart
We give the first nontrivial approximation algorithms for the Steiner tree problem and the generalized Steiner network problem on general directed graphs. These problems have several applications in network design and multicast routing. For both problems, the best ratios known before our work
The polymatroid Steiner problems
 J. Comb. Optim
, 2005
"... Abstract. The Steiner tree problem asks for a minimum cost tree spanning a given set of terminals S ⊆ V in a weighted graph G = (V, E, c), c: E → R +. In this paper we consider a generalization of the Steiner tree problem, so called Polymatroid Steiner Problem, in which a polymatroid P = P (V) is de ..."
Abstract

Cited by 15 (0 self)
 Add to MetaCart
Abstract. The Steiner tree problem asks for a minimum cost tree spanning a given set of terminals S ⊆ V in a weighted graph G = (V, E, c), c: E → R +. In this paper we consider a generalization of the Steiner tree problem, so called Polymatroid Steiner Problem, in which a polymatroid P = P (V
Partitioning Techniques for the Steiner Problem
, 2001
"... Partitioning is one of the basic ideas for designing efficient algorithms, but on NPhard problems like the Steiner problem straightforward application of the classical paradigms for exploiting this idea rarely leads to empirically successful algorithms. In this paper, we present a new approach whic ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Partitioning is one of the basic ideas for designing efficient algorithms, but on NPhard problems like the Steiner problem straightforward application of the classical paradigms for exploiting this idea rarely leads to empirically successful algorithms. In this paper, we present a new approach
Algorithmic Approaches to the Steiner Problem . . .
, 2003
"... The Steiner problem in networks is the problem of connecting a set of required vertices in a weighted graph at minimum cost. This is a classical N Phard problem and a fundamental problem in network design with many practical applications. We approach this problem by different means: Relaxations, wh ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
The Steiner problem in networks is the problem of connecting a set of required vertices in a weighted graph at minimum cost. This is a classical N Phard problem and a fundamental problem in network design with many practical applications. We approach this problem by different means: Relaxations
Algorithms for the Steiner Problem in Networks
, 2003
"... The Steiner problem in networks is the problem of connecting a set of required vertices in a weighted graph at minimum cost. It is a classical N Phard problem with many important applications. For this problem we develop, implement and test several new techniques. On the side of lower bounds, we pr ..."
Abstract
 Add to MetaCart
The Steiner problem in networks is the problem of connecting a set of required vertices in a weighted graph at minimum cost. It is a classical N Phard problem with many important applications. For this problem we develop, implement and test several new techniques. On the side of lower bounds, we
Online Generalized Steiner Problem
, 1996
"... The Generalized Steiner Problem (GSP) is defined as follows. We are given a graph with nonnegative 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. Offline generalized Steiner problem ap ..."
Abstract

Cited by 49 (5 self)
 Add to MetaCart
The Generalized Steiner Problem (GSP) is defined as follows. We are given a graph with nonnegative 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. Offline generalized Steiner problem
An Improved Approximation Ratio for the Covering Steiner Problem. On the Covering Steiner problem
 Theory of Computing
, 2006
"... Abstract: In the Covering Steiner problem, we are given an undirected graph with edgecosts, and some subsets of vertices called groups, with each group being equipped with a nonnegative integer value (called its requirement); the problem is to find a minimumcost tree which spans at least the requi ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
Abstract: In the Covering Steiner problem, we are given an undirected graph with edgecosts, and some subsets of vertices called groups, with each group being equipped with a nonnegative integer value (called its requirement); the problem is to find a minimumcost tree which spans at least
Results 1  10
of
1,332