Results 1  10
of
563,689
Improved Steiner Tree Approximation in Graphs
, 2000
"... The Steiner tree problem in weighted graphs seeks a minimum weight connected subgraph containing a given subset of the vertices (terminals). We present a new polynomialtime heuristic with an approximation ratio approaching 1 + 2 1:55, which improves upon the previously bestknown approximation ..."
Abstract

Cited by 221 (6 self)
 Add to MetaCart
The Steiner tree problem in weighted graphs seeks a minimum weight connected subgraph containing a given subset of the vertices (terminals). We present a new polynomialtime heuristic with an approximation ratio approaching 1 + 2 1:55, which improves upon the previously best
A distributed algorithm for minimumweight spanning trees
, 1983
"... A distributed algorithm is presented that constructs he minimumweight spanning tree in a connected undirected graph with distinct edge weights. A processor exists at each node of the graph, knowing initially only the weights of the adjacent edges. The processors obey the same algorithm and exchange ..."
Abstract

Cited by 432 (3 self)
 Add to MetaCart
A distributed algorithm is presented that constructs he minimumweight spanning tree in a connected undirected graph with distinct edge weights. A processor exists at each node of the graph, knowing initially only the weights of the adjacent edges. The processors obey the same algorithm
Construction of minimumweight spanners
 In Proc. of the 12th European Symposium on Algorithms
, 2004
"... Abstract. Spanners are sparse subgraphs that preserve distances up to a given factor in the underlying graph. Recently spanners have found important practical applications in metric space searching andmessage distribution in networks. These applications use some variant of the socalled greedy algori ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
algorithm for constructing the spanner — an algorithm that mimics Kruskal’s minimum spanning tree algorithm. Greedy spanners have nice theoretical properties, but their practical performance with respect to total weight is unknown. In this paper we give an exact algorithm for constructing minimumweight
A polylogarithmic approximation algorithm for the group Steiner tree problem
 Journal of Algorithms
, 2000
"... The group Steiner tree problem is a generalization of the Steiner tree problem where we ae given several subsets (groups) of vertices in a weighted graph, and the goal is to find a minimumweight connected subgraph containing at least one vertex from each group. The problem was introduced by Reich a ..."
Abstract

Cited by 146 (9 self)
 Add to MetaCart
The group Steiner tree problem is a generalization of the Steiner tree problem where we ae given several subsets (groups) of vertices in a weighted graph, and the goal is to find a minimumweight connected subgraph containing at least one vertex from each group. The problem was introduced by Reich
Planar MinimumWeight Triangulations
, 1995
"... The classic problem of finding a minimumweight triangulation for a given planar straightline graph is considered in this paper. A brief overview of known methods is given in addition to some new results. A parallel greedy triangulation algorithm is presented along with experimental data that sugge ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
The classic problem of finding a minimumweight triangulation for a given planar straightline graph is considered in this paper. A brief overview of known methods is given in addition to some new results. A parallel greedy triangulation algorithm is presented along with experimental data
ON THE STRUCTURE OF MINIMUMWEIGHT kCONNECTED SPANNING NETWORKS
, 1990
"... The problem offinding a minimumweight kconnected spanning subgraph ofa complete graph, assuming that the edge weights satisfy the triangle inequality, is studied. It is shown that the class of minimumweight kedge connected spanning subgraphs can be restricted to those subgraphs which, in additi ..."
Abstract

Cited by 21 (2 self)
 Add to MetaCart
The problem offinding a minimumweight kconnected spanning subgraph ofa complete graph, assuming that the edge weights satisfy the triangle inequality, is studied. It is shown that the class of minimumweight kedge connected spanning subgraphs can be restricted to those subgraphs which
An Efficient Algorithm for MinimumWeight Bibranching
 JOURNAL OF COMBINATORIAL THEORY
, 1996
"... Given a directed graph D = (V; A) and a set S ` V , a bibranching is a set of arcs B ` A that contains a v(V n S) path for every v 2 S and an Sv path for every v 2 V n S. In this paper, we describe a primaldual algorithm that determines a minimum weight bibranching in a weighted digraph. It ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
Given a directed graph D = (V; A) and a set S ` V , a bibranching is a set of arcs B ` A that contains a v(V n S) path for every v 2 S and an Sv path for every v 2 V n S. In this paper, we describe a primaldual algorithm that determines a minimum weight bibranching in a weighted digraph
Minimumweight Cycle Covers and Their Approximability
, 2008
"... A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An Lcycle cover is a cycle cover in which the length of every cycle is in the set L ⊆ N. We investigate how well Lcycle covers of minimum weight can be approximated. For undirected graphs, we devise no ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An Lcycle cover is a cycle cover in which the length of every cycle is in the set L ⊆ N. We investigate how well Lcycle covers of minimum weight can be approximated. For undirected graphs, we devise
Approximability of Minimumweight Cycle Covers
, 2006
"... A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An Lcycle cover is a cycle cover in which the length of every cycle is in the set L ⊆ N. For most sets L, computing Lcycle covers of minimum weight is NPhard and APXhard. While computing Lcycle cove ..."
Abstract
 Add to MetaCart
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An Lcycle cover is a cycle cover in which the length of every cycle is in the set L ⊆ N. For most sets L, computing Lcycle covers of minimum weight is NPhard and APXhard. While computing L
Tighter Bounds for Graph Steiner Tree Approximation
 SIAM Journal on Discrete Mathematics
, 2005
"... Abstract. The classical Steiner tree problem in weighted graphs seeks a minimum weight connected subgraph containing a given subset of the vertices (terminals). We present a new polynomialln 3 time heuristic that achieves a bestknown approximation ratio of 1 + ≈ 1.55 for general graphs 2 and best ..."
Abstract

Cited by 83 (7 self)
 Add to MetaCart
Abstract. The classical Steiner tree problem in weighted graphs seeks a minimum weight connected subgraph containing a given subset of the vertices (terminals). We present a new polynomialln 3 time heuristic that achieves a bestknown approximation ratio of 1 + ≈ 1.55 for general graphs 2 and best
Results 1  10
of
563,689