Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
1,376
On the value of a random minimum weight Steiner tree
- Combinatorica
, 2004
"... Consider a complete graph on n vertices with edge weights chosen randomly and independently from, for example, an exponential distribution with parameter 1. Fix k vertices and consider the minimum weight Steiner tree which contains these vertices. We prove that with high probability the weight of ..."
Abstract
-
Cited by 10 (0 self)
- Add to MetaCart
Consider a complete graph on n vertices with edge weights chosen randomly and independently from, for example, an exponential distribution with parameter 1. Fix k vertices and consider the minimum weight Steiner tree which contains these vertices. We prove that with high probability the weight
Previous Up Next Article Citations From References: 2 From Reviews: 0
"... On the value of a random minimum weight Steiner tree. (English summary) ..."
A distributed algorithm for minimum-weight spanning trees
, 1983
"... A distributed algorithm is presented that constructs he minimum-weight 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 435 (3 self)
- Add to MetaCart
A distributed algorithm is presented that constructs he minimum-weight 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
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 polynomial-time heuristic with an approximation ratio approaching 1 + 2 1:55, which improves upon the previously best-known approximation ..."
Abstract
-
Cited by 225 (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 polynomial-time heuristic with an approximation ratio approaching 1 + 2 1:55, which improves upon the previously best
Fibonacci Heaps and Their Uses in Improved Network optimization algorithms
, 1987
"... In this paper we develop a new data structure for implementing heaps (priority queues). Our structure, Fibonacci heaps (abbreviated F-heaps), extends the binomial queues proposed by Vuillemin and studied further by Brown. F-heaps support arbitrary deletion from an n-item heap in qlogn) amortized tim ..."
Abstract
-
Cited by 739 (18 self)
- Add to MetaCart
matching), improved from O(nm log0dn+2)n); (4) O(mj3(m, n)) for the minimum spanning tree problem, improved from O(mloglo&,,.+2,n), where j3(m, n) = min {i 1 log % 5 m/n). Note that B(m, n) 5 log*n if m 2 n. Of these results, the improved bound for minimum spanning trees is the most striking, although
A general approximation technique for constrained forest problems
- SIAM J. COMPUT.
, 1995
"... We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph with trees, cycles, or paths satisfying certain requirements. In particular, many basic combinatorial optimization proble ..."
Abstract
-
Cited by 414 (21 self)
- Add to MetaCart
problems fit in this framework, including the shortest path, minimum-cost spanning tree, minimum-weight perfect matching, traveling salesman, and Steiner tree problems. Our technique produces approximation algorithms that run in O(n log n) time and come within a factor of 2 of optimal for most
Simple fast algorithms for the editing distance between trees and related problems
- SIAM J. COMPUT
, 1989
"... Ordered labeled trees are trees in which the left-to-right order among siblings is. significant. The distance between two ordered trees is considered to be the weighted number of edit operations (insert, delete, and modify) to transform one tree to another. The problem of approximate tree matching i ..."
Abstract
-
Cited by 405 (12 self)
- Add to MetaCart
Ordered labeled trees are trees in which the left-to-right order among siblings is. significant. The distance between two ordered trees is considered to be the weighted number of edit operations (insert, delete, and modify) to transform one tree to another. The problem of approximate tree matching
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
- Journal of the ACM
, 1998
"... Abstract. We present a polynomial time approximation scheme for Euclidean TSP in fixed dimensions. For every fixed c Ͼ 1 and given any n nodes in 2 , a randomized version of the scheme finds a (1 ϩ 1/c)-approximation to the optimum traveling salesman tour in O(n(log n) O(c) ) time. When the nodes ..."
Abstract
-
Cited by 397 (2 self)
- Add to MetaCart
to Christofides) achieves a 3/2-approximation in polynomial time. We also give similar approximation schemes for some other NP-hard Euclidean problems: Minimum Steiner Tree, k-TSP, and k-MST. (The running times of the algorithm for k-TSP and k-MST involve an additional multiplicative factor k.) The previous best
Approximating the Weight of Shallow Steiner Trees
- DAMATH: Discrete Applied Mathematics and Combinatorial Operations Research and Computer Science
, 1998
"... This paper deals with the problem of constructing Steiner trees of minimum weight with diameter bounded by d, spanning a given set of k vertices in a graph. Exact solutions or logarithmic ratio approximation algorithms were known before for the cases of d <= 5. Here we give a polynomial time appr ..."
Abstract
-
Cited by 32 (3 self)
- Add to MetaCart
This paper deals with the problem of constructing Steiner trees of minimum weight with diameter bounded by d, spanning a given set of k vertices in a graph. Exact solutions or logarithmic ratio approximation algorithms were known before for the cases of d <= 5. Here we give a polynomial time
When trees collide: An approximation algorithm for the generalized Steiner problem on networks
, 1994
"... We give the first approximation algorithm for the generalized network Steiner problem, a problem in network design. An instance consists of a network with link-costs and, for each pair fi; jg of nodes, an edge-connectivity requirement r ij . The goal is to find a minimum-cost network using the a ..."
Abstract
-
Cited by 249 (38 self)
- Add to MetaCart
We give the first approximation algorithm for the generalized network Steiner problem, a problem in network design. An instance consists of a network with link-costs and, for each pair fi; jg of nodes, an edge-connectivity requirement r ij . The goal is to find a minimum-cost network using
Results 1 - 10
of
1,376
