Fast approximation of steiner trees in large graphs

  title={Fast approximation of steiner trees in large graphs},
  author={Andrey Gubichev and Thomas Neumann},
Finding the minimum connected subtree of a graph that contains a given set of nodes (i.e., the Steiner tree problem) is a fundamental operation in keyword search in graphs, yet it is known to be NP-hard. Existing approximation techniques either make use of the heavy indexing of the graph, or entirely rely on online heuristics. In this paper we bridge the gap between these two extremes and present a scalable landmark-based index structure that, combined with a few lightweight online heuristics… CONTINUE READING


Publications referenced by this paper.
Showing 1-5 of 5 references

STAR: Steiner-Tree Approximation in Relationship Graphs

2009 IEEE 25th International Conference on Data Engineering • 2009
View 7 Excerpts
Highly Influenced

BLINKS: ranked keyword searches on graphs

SIGMOD Conference • 2007
View 13 Excerpts
Highly Influenced

Finding Top-k Min-Cost Connected Trees in Databases

2007 IEEE 23rd International Conference on Data Engineering • 2007
View 6 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…