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(ke)-approximation algorithms for arbitrarily small values of e > 0, improving on the previou...

Full description

Saved in:
Bibliographic Details
Published inDesign, Automation, and Test in Europe: Proceedings of the conference on Design, automation and test in Europe; 23-26 Feb. 1998 pp. 406 - 413
Main Authors Helvig, C S, Robins, G, Zelikovsky, A
Format Conference Proceeding
LanguageEnglish
Published 01.02.1998
Online AccessGet full text

Cover

More Information
Summary: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(ke)-approximation algorithms for arbitrarily small values of e > 0, improving on the previously known O(k0.5)-approximation. Our techniques also solve the graph Steiner arborescence problem with an O(ke) 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.
Bibliography:ObjectType-Conference Paper-1
SourceType-Conference Papers & Proceedings-1
content type line 25
ISBN:0818683597
9780818683596
DOI:10.1145/267665.267697