Combinatorial Optimization

# Steiner Trees in Industry

Editors: Cheng, Xiuzhen, Du, Ding-Zhu (Eds.)

Free Preview

eBook 219,00 €
price for Spain (gross)
• ISBN 978-1-4613-0255-1
• Digitally watermarked, DRM-free
• Included format: PDF
• ebooks can be used on all reading devices
Hardcover 269,36 €
price for Spain (gross)
• ISBN 978-1-4020-0099-7
• Free shipping for individuals worldwide
• Usually dispatched within 3 to 5 business days.
• The final prices may differ from the prices shown due to specifics of VAT rules

This book is a collection of articles studying various Steiner tree prob­ lems with applications in industries, such as the design of electronic cir­ cuits, computer networking, telecommunication, and perfect phylogeny. The Steiner tree problem was initiated in the Euclidean plane. Given a set of points in the Euclidean plane, the shortest network interconnect­ ing the points in the set is called the Steiner minimum tree. The Steiner minimum tree may contain some vertices which are not the given points. Those vertices are called Steiner points while the given points are called terminals. The shortest network for three terminals was first studied by Fermat (1601-1665). Fermat proposed the problem of finding a point to minimize the total distance from it to three terminals in the Euclidean plane. The direct generalization is to find a point to minimize the total distance from it to n terminals, which is still called the Fermat problem today. The Steiner minimum tree problem is an indirect generalization. Schreiber in 1986 found that this generalization (i.e., the Steiner mini­ mum tree) was first proposed by Gauss.

• Steiner Minimum Trees in Uniform Orientation Metrics

Pages 1-27

Brazil, Marcus

• Genetic Algorithm Approaches to Solve Various Steiner Tree Problems

Pages 29-69

Chakraborty, Goutam

• Neural Network Approaches to Solve Various Steiner Tree Problems

Pages 71-100

Chakraborty, Goutam

• Steiner Tree Problems in VLSI Layout Designs

Pages 101-173

Cho, Jun-Dong

• Polyhedral Approaches for the Steiner Tree Problem on Graphs

Pages 175-201

Chopra, Sunil (et al.)

eBook 219,00 €
price for Spain (gross)
• ISBN 978-1-4613-0255-1
• Digitally watermarked, DRM-free
• Included format: PDF
• ebooks can be used on all reading devices
Hardcover 269,36 €
price for Spain (gross)
• ISBN 978-1-4020-0099-7
• Free shipping for individuals worldwide
• Usually dispatched within 3 to 5 business days.
• The final prices may differ from the prices shown due to specifics of VAT rules

## Bibliographic Information

Bibliographic Information
Book Title
Steiner Trees in Industry
Editors
• Xiuzhen Cheng
• Ding-Zhu Du
Series Title
Combinatorial Optimization
Series Volume
11
2001
Publisher
Springer US