The Algorithm Design Manual
About the Book
Programming Challenges

The Stony Brook Algorithm Repository

Steven Skiena
Stony Brook University
Dept. of Computer Science

FLUTE: Fast Lookup Table Based Technique for RSMT Construction and Wirelength Estimation

FLUTE is a very fast and accurate technique originally designed for wirelength estimation. It is later extended to also perform rectilinear Steiner minimal tree (RSMT) construction. There is a user-defined parameter to control the tradeoff between accuracy and runtime. FLUTE is optimal and extremely fast for nets up to degree 9. For higher degree nets, it is still very fast and accurate. As it handles low degree nets particularly well, it is most suitable for VLSI applications in which most nets have a degree 30 or less.
  • Download Files (local site)
  • Offical Site

    Problem Links

    Steiner Tree (9)

    This page last modified on 2008-07-10 .