Improved approximation bounds for the group Steiner problem

Given a weighted graph and a family of k disjoint groups of nodes, the group Steiner problem asks for a minimum-cost routing tree that contains at least one node from each group. We give polynomial-time O(k/sup /spl epsiv//)-approximation algorithms for arbitrarily small values of /spl epsiv/>0, improving on the previously known O(k/sup 1/2 /)-approximation. Our techniques also solve the graph Steiner arborescence problem with an O(k/sup /spl epsiv//) approximation bound. These results are directly applicable to a practical problem in VLSI layout, namely the routing of nets with multi-port terminals. Our Java implementation is available on the Web.

[1]  Andrew B. Kahng,et al.  A new class of iterative Steiner tree heuristics with good performance , 1992, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[2]  Gabriele Reich,et al.  Beyond Steiner's Problem: A VLSI Oriented Generalization , 1989, WG.

[3]  Andrew B. Kahng,et al.  A direct combination of the Prim and Dijkstra constructions for improved performance-driven global routing , 1993, 1993 IEEE International Symposium on Circuits and Systems.

[4]  Edmund Ihler,et al.  Bounds on the quality of approximate solutions to the Group Steiner Problem , 1990, WG.

[5]  Jeffrey S. Salowe,et al.  Closing the gap: near-optimal Steiner trees in polynomial time , 1994, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[6]  Edmund Ihler,et al.  The Complexity of Approximating the Class Steiner Tree Problem , 1991, WG.

[7]  A. Kahng,et al.  On optimal interconnections for VLSI , 1994 .

[8]  Uriel Feige.  A threshold of ln n for approximating set cover (preliminary version) , 1996, STOC '96.

[9]  Alex Zelikovsky.  A Faster Approximation Algorithm for the Steiner Tree Problem in Graphs , 1993, Inf. Process. Lett..

[10]  Piotr Berman,et al.  Improved approximations for the Steiner tree problem , 1992, SODA '92.

[11]  G. Reinelt.  The traveling salesman: computational solutions for TSP applications , 1994 .

[12]  Eugene L. Lawler,et al.  The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization , 1985 .

[13]  Alex Zelikovsky,et al.  Provably good routing tree construction with multi-port terminals , 1997, ISPD '97.

[14]  Jason Cong,et al.  Provably good performance-driven global routing , 1992, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[15]  Eugene L. Lawler,et al.  A solvable case of the traveling salesman problem , 1971, Math. Program..