Add to ORKGGiven a weighted graph with some subsets of vertices called groups, the group Steiner tree problem is to find a minimum-weight subgraph which contains at least one vertex from each group. We give a randomized algorithm with a polylogarithmic approximation guarantee for the group Steiner tree problem. The previous best approximation guarantee was O (i2k1/i) in time O (nik2i) (Charikar, Chekuri, Goel, and Guha). Our algorithm also improves existing approximation results for network design problems with location-based constraints and for the symmetric generalized traveling salesman proble
In the Group Steiner Tree problem (GST), we are given a (edge or vertex)-weighted graph G = (V,E) on...
The classical Steiner tree problem in weighted graphs seeks a mini-mum weight connected subgraph con...
In the Group Steiner Tree problem (GST), we are given a (edge or vertex)-weighted graph G = (V,E) on...
Given a weighted graph with some subsets of vertices called groups, the group Steiner tree problem i...
Given a weighted graph with some subsets of vertices called groups, the group Steiner tree problem i...
Given a weighted graph with some subsets of vertices called groups, the group Steiner tree problem i...
Given a weighted graph with some subsets of vertices called groups, the group Steiner tree problem ...
The group Steiner tree problem is a generalization of the Steiner tree problem where we are given se...
The group Steiner tree problem is a generalization of the Steiner tree problem where we are given se...
The covering Steiner problem is a generalization of both the k-MST and the group Steiner problems: g...
In this lecture, we show how to use the Randomized Rounding to devise a polylogarithmic approximatio...
Given a weightedgraph and a family of k disjoint groups of nodes, the Group Steiner Problem asks for...
We improve the approximation ratios for two optimization problems in planar graphs. For node-weighte...
In the group Steiner problem we are given a graph with edge weights w(e) and m subsets of vertices ...
AbstractIn the group Steiner problem we are given an edge-weighted graph G=(V,E,w) and m subsets of ...
In the Group Steiner Tree problem (GST), we are given a (edge or vertex)-weighted graph G = (V,E) on...
The classical Steiner tree problem in weighted graphs seeks a mini-mum weight connected subgraph con...
In the Group Steiner Tree problem (GST), we are given a (edge or vertex)-weighted graph G = (V,E) on...
Given a weighted graph with some subsets of vertices called groups, the group Steiner tree problem i...
Given a weighted graph with some subsets of vertices called groups, the group Steiner tree problem i...
Given a weighted graph with some subsets of vertices called groups, the group Steiner tree problem i...
Given a weighted graph with some subsets of vertices called groups, the group Steiner tree problem ...
The group Steiner tree problem is a generalization of the Steiner tree problem where we are given se...
The group Steiner tree problem is a generalization of the Steiner tree problem where we are given se...
The covering Steiner problem is a generalization of both the k-MST and the group Steiner problems: g...
In this lecture, we show how to use the Randomized Rounding to devise a polylogarithmic approximatio...
Given a weightedgraph and a family of k disjoint groups of nodes, the Group Steiner Problem asks for...
We improve the approximation ratios for two optimization problems in planar graphs. For node-weighte...
In the group Steiner problem we are given a graph with edge weights w(e) and m subsets of vertices ...
AbstractIn the group Steiner problem we are given an edge-weighted graph G=(V,E,w) and m subsets of ...
In the Group Steiner Tree problem (GST), we are given a (edge or vertex)-weighted graph G = (V,E) on...
The classical Steiner tree problem in weighted graphs seeks a mini-mum weight connected subgraph con...
In the Group Steiner Tree problem (GST), we are given a (edge or vertex)-weighted graph G = (V,E) on...