An approximate algorithm for finding Steiner Forest.

Posted by Tadeusz A. Kadlubowski on Stack Overflow See other posts from Stack Overflow or by Tadeusz A. Kadlubowski
Published on 2010-04-19T16:38:51Z Indexed on 2010/04/19 16:43 UTC
Read the original article Hit count: 463

Filed under:

graph-theory

|

trees

|

algorithm

|

approximation

Hello.

Consider a weighted graph G=(V,E,w). We are given a family of subsets of vertices V_i. Those sets of vertices are not necessarily disjoint.

A Steiner Forest is a forest that for each subset of vertices V_i connects all of the vertices in this subset with a tree.

Example: only one subset V_1 = V. In this case a Steiner forest is a spanning tree of the whole graph.

Enough theory. Finding such a forest with minimal weight is difficult (NP-complete). Do you know any quicker approximate algorithm to find such a forest with non-optimal weight?

© Stack Overflow or respective owner

Related posts about graph-theory

Graph theory in python

as seen on Stack Overflow - Search for 'Stack Overflow'
I was wondering how people deal with graph theory in python? How is a graph stored? Are there libraries for this? For example how would I input a graph and then find its Chromatic polynomial? Or its girth? Or the number of unique spanning trees? How about problems that involve edge weight like salesman… >>> More
What is the relaxation condition in graph theory

as seen on Stack Overflow - Search for 'Stack Overflow'
Hi, I'm trying to understand the main concepts of graph theory and the algorithms within it. Most algorithms seem to contain a "Relaxation Condition" I'm unsure about what this is. Could some one explain it to me please. An example of this is dijkstras algorithm, here is the pseudo-code. 1 … >>> More
Translation of clustering problem to graph theory language

as seen on Stack Overflow - Search for 'Stack Overflow'
I have a rectangular planar grid, with each cell assigned some integer weight. I am looking for an algorithm to identify clusters of 3 to 6 adjacent cells with higher-than-average weight. These blobs should have approximately circular shape. For my case the average weight of the cells not containing… >>> More
box stacking in graph theory

as seen on Stack Overflow - Search for 'Stack Overflow'
Please help me find a good solution for this problem. We have n boxes with 3 dimensions. We can orient them and we want to put them on top of another to have a maximun height. We can put a box on top of an other box, if 2 dimensions (width and lenght) are lower than the dimensions of the box below… >>> More
Is finding graph minors without single node pinch points possible?

as seen on Game Development - Search for 'Game Development'
Is it possible to robustly find all the graph minors within an arbitrary node graph where the pinch points are generally not single nodes? I have read some other posts on here about how to break up your graph into a Hamiltonian cycle and then from that find the graph minors but it seems to be such… >>> More

Related posts about trees

Paged binary trees vs. AVL trees and B-trees

as seen on Stack Overflow - Search for 'Stack Overflow'
How are paged binary trees different from AVL trees and B-trees? >>> More
Minimum and maximum height of binary search trees, 2-3-4 trees and B trees.

as seen on Stack Overflow - Search for 'Stack Overflow'
Hi, note this is not homework. But can anyone tell me how you find the min/max height of B trees, 2-3-4 trees and binary search trees? Thanks >>> More
Difference between B Trees and 2-3-4 Trees

as seen on Stack Overflow - Search for 'Stack Overflow'
Hi, Could someone please explain to me the difference between B Trees and 2-3-4 Trees? And also how would you find the maximum and minimum height of each? Thanks >>> More
B- trees, B+ trees difference

as seen on Stack Overflow - Search for 'Stack Overflow'
In a B- tree you can store both keys and data in the internal/leaf nodes. But in a B+ tree you have to store the data in the leaf nodes only. Is there any advantage of doing the above in a B+ tree? Why not use B- trees instead of B+ trees everywhere? As intuitively they seem much faster. I mean why… >>> More
What is the usage of Splay Trees in the real world?

as seen on Programmers - Search for 'Programmers'
I decided to learn about balanced search trees, so I picked 2-3-4 and splay trees. What are the examples of splay trees usage in the real world? In this Cornell: http://www.cs.cornell.edu/courses/cs3110/2009fa/recitations/rec-splay.html I read that splay trees are 'A good example is a network router'… >>> More