By Topic

Bottleneck Steiner trees in the plane

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)
Sarrafzadeh, M. ; Dept. of Electr. Eng. & Comput. Sci., Northwestern Univ., Evanston, IL, USA ; Wong, C.K.

A Steiner tree with maximum-weight edge minimized is called a bottleneck Steiner tree (BST). The authors propose a Θ(|ρ| log |ρ|) time algorithm for constructing a BST on a point set ρ, with points labeled as Steiner or demand; a lower bound, in the linear decision tree model, is also established. It is shown that if it is desired to minimize further the number of used Steiner points, then the problem becomes NP-complete. It is shown that when locations of Steiner points are not fixed the problem remains NP-complete; however, if the topology of the final tree is given, then the problem can be solved in Θ(|ρ| log |ρ|) time. The BST problem can be used, for example, in VLSI layout, communication network design, and (facility) location problems

Published in:

Computers, IEEE Transactions on  (Volume:41 ,  Issue: 3 )