Skip to main content
Article thumbnail
Location of Repository

Efficient Algorithms for the Minimum Shortest Path Steiner Arborescence Problem with Applications to VLSI Physical Design

By Jason Cong, Andrew B. Kahng and Kwok-shing Leung


Given an undirected graph G =(V;E) with positive edge weights (lengths) w: E!<+, a set of terminals (sinks) N V, and a unique root node r 2 N, a shortest-path Steiner arborescence (simply called an arborescence in the following) is a Steiner tree rooted at r spanning all terminals in N such thatevery sourceto-sink path is a shortest path in G. Given a triple (G; N; r), the Minimum Shortest-Path Steiner Arborescence (MSPSA) problem seeks an arborescence with minimum weight. The MSPSA problem has various applications in the areas of VLSI physical design, multicast network communication, and supercomputer message routing; various cases have been studied in the literature. In this paper, we propose several heuristics and exact algorithms for the MSPSA problem with applications to VLSI physical design. Experiments indicate that ou

Year: 2011
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.