A faster approximation algorithm for the Steiner problem in graphs

  title={A faster approximation algorithm for the Steiner problem in graphs},
  author={Ying-Fung Wu and Peter Widmayer and Chak-Kuen Wong},
  journal={Acta Informatica},
SummaryWe present an algorithm for finding a Steiner tree for a connected, undirected distance graph with a specified subset S of the set of vertices V. The set V-S is traditionally denoted as Steiner vertices. The total distance on all edges of this Steiner tree is at most 2(1−1/l) times that of a Steiner minimal tree, where l is the minimum number of leaves in any Steiner minimal tree for the given graph. The algorithm runs in O(¦E¦log¦V¦) time in the worst case, where E is the set of all… 

Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View

A more precise way to find the so-called improved stars which yield a slightly better solution within a comparable running time (on average $\sim 3\times$ slower).

Distributed Approximation Algorithms for Steiner Tree in the CONGESTED CLIQUE

This paper presents two deterministic distributed approximation algorithms for the Steiner tree problem in the CONGESTED CLIQUE model of distributed computing and exhibits better performance than the second one in terms of the round complexity.

Steiner Minimal Trees

Exact algorithms for the Steiner Tree Problem

This thesis improves the running time of algorithm to O(2.684k) by showing that the optimum Steiner tree T can be partitioned into T = T1 [ T2 [ T3 in a certain way such that each Ti is a minimum Steiners tree in a suitable contracted graph Gi with less than k 2 terminals.

Towards Distributed 2-Approximation Steiner Minimal Trees in Billion-edge Graphs

A parallel 2-approximation Steiner minimal tree algorithm (with theoretical guarantees) and its MPI-based distributed implementation that has higher parallel efficiency than others that involve minimum spanning tree computation on the entire graph and employs a combination of vertex and edge centric processing to offer fast time-to-solution.

The Power of Dynamic Distance Oracles: Efficient Dynamic Algorithms for the Steiner Tree

This paper shows a polylogarithmic time (4+ε)-approximate algorithm for planar graphs, one of the main building blocks of the algorithms are dynamic distance oracles for vertex-labeled graphs, which are of independent interest.

On the minimum spanning tree problem in imprecise set-up

It is shown that finding a minimum spanning tree that contains exactly one end-point from each segment in S and the cost of the MST is minimum among 2 possible MSTs is NP-hard, and a 2α-factor approximation algorithm is proposed, where α is the approximation factor of the best-known approximation algorithm to compute a minimum cost Steiner tree in an undirected graph with non-negative edgeweights.

Dynamic Graph Algorithms for Connectivity Problems

This thesis presents several new algorithms for dynamic graph problems, including an algorithm for decremental connectivity in planar graphs, the maintenance of connected components in a dynamic graph, and the Steiner tree problem over a dynamic set of terminals.

An 11/6-approximation algorithm for the network steiner problem

An instance of the Network Steiner Problem consists of an undirected graph with edge lengths and a subset of vertices; the goal is to find a minimum cost Steiner tree of the given subset (i.e.,

Dynamic Steiner Tree and Subgraph TSP

The Steiner tree problem is studied over a dynamic set of terminals, and appropriate methods that contribute to both online approximation algorithms and dynamic algorithms are developed.



A fast algorithm for Steiner trees

The heuristic algorithm has a worst case time complexity of O(¦S¦¦V¦2) on a random access computer and it guarantees to output a tree that spans S with total distance on its edges no more than 2(1−1/l) times that of the optimal tree.

Steiner Minimal Trees

An integer linear programming approach to the steiner problem in graphs

  • Y. Aneja
  • Mathematics, Computer Science
  • 1980
A method called the row generation scheme is developed to solve the problem of obtaining a minimal weighted tree which spans the set S of nodes, termed in literature as the Steiner problem in graphs.

An algorithm for the steiner problem in graphs

  • J. Beasley
  • Mathematics, Computer Science
  • 1984
In this paper we consider the Steiner problem in graphs. This is the problem of connecting together, at minimum cost, a number of vertices in an undirected graph. We present two lower bounds for the

Some Remarks on the Steiner Problem

  • H. Pollak
  • Mathematics
    J. Comb. Theory, Ser. A
  • 1978

A note on two problems in connexion with graphs

  • E. Dijkstra
  • Mathematics, Computer Science
    Numerische Mathematik
  • 1959
A tree is a graph with one and only one path between every two nodes, where at least one path exists between any two nodes and the length of each branch is given.

Some NP-complete geometric problems

We show that the STEINER TREE problem and TRAVELING SALESMAN problem for points in the plane are NP-complete when distances are measured either by the rectilinear (Manhattan) metric or by a natural

A Short Proof of a Result of Pollak on Steiner Minimal Trees

On the shortest spanning subtree of a graph and the traveling salesman problem

7. A. Kurosh, Ringtheoretische Probleme die mit dem Burnsideschen Problem uber periodische Gruppen in Zussammenhang stehen, Bull. Acad. Sei. URSS, Ser. Math. vol. 5 (1941) pp. 233-240. 8. J.

Reducibility Among Combinatorial Problems

  • R. Karp
  • Computer Science
    50 Years of Integer Programming
  • 1972
Throughout the 1960s I worked on combinatorial optimization problems including logic circuit design with Paul Roth and assembly line balancing and the traveling salesman problem with Mike Held, which made me aware of the importance of distinction between polynomial-time and superpolynomial-time solvability.