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

Full description

Saved in:
Bibliographic Details
Published inProceedings of the conference on Design, automation and test in Europe pp. 406 - 413
Main Authors Helvig, C. S., Robins, G., Zelikovsky, A.
Format Conference Proceeding
LanguageEnglish
Published Washington, DC, USA IEEE Computer Society 23.02.1998
SeriesACM Conferences
Subjects
Hardware > Electronic design automation > Physical design (EDA) > Partitioning and floorplanning
Hardware > Very large scale integration design
Mathematics of computing > Discrete mathematics
Mathematics of computing > Mathematical analysis > Functional analysis > Approximation
Theory of computation > Design and analysis of algorithms > Approximation algorithms analysis
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(k^e)-approximation algorithms for arbitrarily small values of e>0, improving on the previously known O(k^0.5)-approximation. Our techniques also solve the graph Steiner arborescence problem with an O(k^e) 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.
ISBN:0818683597
9780818683596
DOI:10.5555/368058.368250