By Topic

The Steiner tree problem with minimum number of vertices in graphs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Kia Makki ; Dept. of Comput. Sci., Nevada Univ., Las Vegas, NV, USA ; Pissinou, N.

The Steiner tree problem is to find a tree in a connected undirected distance graph G=(V, E, d) which spans a given set S⊆V. The minimum Steiner tree for G and S is a tree which spans S with a minimum total distance on its edges. The authors consider a special case of the Steiner tree problem in graphs. For this problem they assume that the underlying graph G does not have any direct edge between the vertices in S⊆V. The problem is to find a tree in G which spans the vertices in S and uses minimum number of vertices in V-S

Published in:

VLSI, 1992., Proceedings of the Second Great Lakes Symposium on

Date of Conference:

28-29 Feb 1992