Bookstore

---

Amazon.com is pleased to have The Steiner Tree Page in the family of Amazon.com associates. We've agreed to ship books and provide customer service for orders we receive through special links on The Steiner Tree Page.

Amazon.com associates list selected books in an editorial context that helps you choose the right books. We encourage you to visit The Steiner Tree Page often to see what new books they've selected for you.

Thank you for shopping with an Amazon.com associate.

Sincerely,

Jeff Bezos
President
Amazon.com Books

P.S. We guarantee you the same high level of customer service you would receive at Amazon.com. If you have a question about an order you've placed, please don't hesitate to contact us.

Welcome to the Steiner Tree Page-Amazon.com bookstore. Here we have listed, and in some cases reviewed, books on the Steiner tree problem and related problems or topics that Steiner tree researchers may find interesting. You may order these books directly from Amazon.com by following the link provided with each review.

Note: We do not get credit for other books you add to your shopping cart after following our link, nor for books you order directly from the Amazon.com web site without going through The Steiner Tree Page. So please order by following the links from here, and let us know if there are books that should be here but aren't! Note also that if prices change, obviously the ones you see after following the link to Amazon.com are the correct ones.

Note also: If you want to order a book that isn't listed here, go through this link.

• Books devoted to the Steiner Tree Problem

  • The Steiner Tree Problem by F. K. Hwang, D. S. Richards, and P. Winter.
    North-Holland, 1992. Price: $158.25.
    This is the most complete reference I've seen on the Steiner tree problem. It is written in three parts, covering the Euclidean, Graph, and Rectilinear Steiner Tree problems. Each part includes basic properties of the problem, complexity results, exact algorithms, heuristics and approximation algorithms, and algorithms for special cases of the problem. Sections are also included on the phylogeny problem in computational biology and on electronic physical design applications. It covers almost all of the important Steiner tree research as of its publication, and is a must-have for anyone doing Steiner tree research. -Joe Ganley
    Click here to order this book from Amazon.com

  • Minimal Networks: The Steiner Problem and its Generalizations by A. O. Ivanov and A. A. Tuzhelin.
    CRC Press, 1994. Price: $110.00.
    I have not seen this book. I would appreciate it if someone who has could send me a few sentences about it, which I will place here. -Joe Ganley
    Click here to order this book from Amazon.com

• Books containing substantial information on the Steiner Tree Problem

  • Advanced Routing of Electronic Modules by M. Pecht and Y. T. Wong (editors).
    CRC Press, 1995. Price: $95.00.
    This book contains several chapters on rectilinear Steiner trees, including one by Chao and Hsu on refinement approaches for RST construction, one by Jim Cohoon and myself on RSTs in the presence of obstacles, and one by the editors on an exact RST algorithm. -Joe Ganley
    Click here to order this book from Amazon.com

  • On Optimal Interconnections for VLSI by A. B. Kahng and G. Robins.
    Kluwer Academic Publishers, 1995. Price: $89.50.
    This book started life as Gabriel Robins's Ph.D. dissertation. It contains quite a bit of material on rectilinear Steiner tree heuristics, as well as a lot of good material on other types of routing constructions (minimum-delay, balanced cost/radius, minimum-congestion, etc.). -Joe Ganley
    Click here to order this book from Amazon.com

  • Approximation Algorithms for NP-Hard Problems by D. S. Hochbaum (editor).
    PWS Publishing, 1996. Price: $72.95.
    Chapter 8 is "Approximation Algorithms for Geometric Problems," by Marshall Bern and David Eppstein, and contains about 16 pages on approximating Steiner trees. (The rest of the chapter is excellent as well, and I'd welcome reviews of the entire book.) -Joe Ganley
    Click here to order this book from Amazon.com

• Books that probably contain substantial information on the Steiner Tree Problem (reviews welcomed)
  • An Introduction to VLSI Physical Design by M. Sarrafzadeh and C. K. Wong.
    McGraw-Hill, 1996. Price: $79.69.
    Would someone like to send a review? -Joe Ganley
    Click here to order this book from Amazon.com

• Books that contain some information on Steiner trees and/or related problems
  • Computational Support for Discrete Mathematics by N. Dean and G. E. Shannon (editors).
    AMS, 1994. Price: $77.00.
    Contains [Thomborson, Alpern, and Carter], plus a lot of other interesting but not Steiner-tree-related papers. -Joe Ganley
    Click here to order this book from Amazon.com

  • Parallel Algorithms and Architectures (LNCS 269) by A. Albrecht and K. Mehlhorn (editors).
    Springer-Verlag, 1987. Price: $23.20.
    Contains [Thomborson, Deneen, and Shute]. -Joe Ganley
    Click here to order this book from Amazon.com

  • Algorithms for VLSI Physical Design Automation by N. A. Sherwani.
    Kluwer Academic Publishers, 1993. Price: $105.00.
    Would someone like to send a review? -Joe Ganley
    Click here to order this book from Amazon.com

• Other books that may be of interest to Steiner tree researchers
  • Introduction to Algorithms by T. H. Cormen, C. E. Leiserson, and R. L. Rivest.
    MIT Press, 1990. Price: $60.00.
    I believe that this, along with Garey and Johnson (below), are the two essential books for algorithms researchers. This book (which we've always called "the Big White Book") has it all. -Joe Ganley
    Click here to order this book from Amazon.com

  • Computers and Intractability: A Guide to the Theory of NP-Completeness by M. R. Garey and D. S. Johnson.
    W. H. Freeman, 1979. Price: $26.95.
    The other must-have for algorithms researchers. Though there has been a great deal of work since this was published, the basic principles of proving NP-completeness and the list of problems are as sound and fundamental as they were in 1979. (Watch this space for David Johnson's new book containing the collected NP-Completeness Columns from Journal of Algorithms.) -Joe Ganley
    Click here to order this book from Amazon.com

  • Data Structures and Network Algorithms by R. E. Tarjan.
    SIAM Press, 1983. Price: $24.00.
    Would someone like to send a review? -Joe Ganley
    Click here to order this book from Amazon.com