In this paper we present an RNC-algorithm for finding a minimum spanning tree in a weighted 3-uniform hypergraph, assuming the edge weights are given in unary, and a fully polynomial time randomized approximation scheme if the edge weights are given in binary. From this result we then derive RNC-approximation algorithms for the Steiner problem in networks with approximation ratio (1 + ffl) 5=3 for all ffl ? 0
[[abstract]]This paper considers a family of randomized on-line algorithms. Algorithm R(m), where 1 ...
AbstractThis paper deals with the problem of constructing Steiner trees of minimum weight with diame...
The Steiner tree problem asks for a shortest subgraph connecting a given set of terminals in a graph...
In this paper we present an RNC-algorithm for finding a minimum spanning tree in a weighted 3-unifor...
In this paper we consider the probable performance of three polynomial time approximation algorithm...
Abstract. We give the first approximation algorithm for the generalized network Steiner problem, a p...
The classical Steiner tree problem in weighted graphs seeks a mini-mum weight connected subgraph con...
Given a weighted graph with some subsets of vertices called groups, the group Steiner tree problem i...
AbstractGiven n terminals in the Euclidean plane and a positive constant, find a Steiner tree interc...
Abstract. Given n terminals in the Euclidean plane and a positive constant, find a Steiner tree inte...
[[abstract]]This paper considers a family of randomized on-line algorithms, Algorithm R(m), where 1&...
Given a weighted graph with some subsets of vertices called groups, the group Steiner tree problem i...
The covering Steiner problem is a generalization of both the k-MST and the group Steiner problems: g...
Given a weighted graph with some subsets of vertices called groups, the group Steiner tree problem i...
We give the first approximation algorithm for the generalized network Steiner problem, a problem in ...
[[abstract]]This paper considers a family of randomized on-line algorithms. Algorithm R(m), where 1 ...
AbstractThis paper deals with the problem of constructing Steiner trees of minimum weight with diame...
The Steiner tree problem asks for a shortest subgraph connecting a given set of terminals in a graph...
In this paper we present an RNC-algorithm for finding a minimum spanning tree in a weighted 3-unifor...
In this paper we consider the probable performance of three polynomial time approximation algorithm...
Abstract. We give the first approximation algorithm for the generalized network Steiner problem, a p...
The classical Steiner tree problem in weighted graphs seeks a mini-mum weight connected subgraph con...
Given a weighted graph with some subsets of vertices called groups, the group Steiner tree problem i...
AbstractGiven n terminals in the Euclidean plane and a positive constant, find a Steiner tree interc...
Abstract. Given n terminals in the Euclidean plane and a positive constant, find a Steiner tree inte...
[[abstract]]This paper considers a family of randomized on-line algorithms, Algorithm R(m), where 1&...
Given a weighted graph with some subsets of vertices called groups, the group Steiner tree problem i...
The covering Steiner problem is a generalization of both the k-MST and the group Steiner problems: g...
Given a weighted graph with some subsets of vertices called groups, the group Steiner tree problem i...
We give the first approximation algorithm for the generalized network Steiner problem, a problem in ...
[[abstract]]This paper considers a family of randomized on-line algorithms. Algorithm R(m), where 1 ...
AbstractThis paper deals with the problem of constructing Steiner trees of minimum weight with diame...
The Steiner tree problem asks for a shortest subgraph connecting a given set of terminals in a graph...
DOI
Add to ORKG