• 1-800-526-8630U.S. (TOLL FREE)
  • 1-917-300-0470EAST COAST U.S.
  • +353-1-416-8900REST OF WORLD

This product is currently not available for purchase.



  • ID: 1898669
  • March 2010
  • 116 Pages
  • VDM Publishing House

The rectilinear Steiner tree problem is an NP- complete problem with many important applications in networks and very large scale integration (VLSI) design. This book examines the rectilinear Steiner tree problem and proposes sequential and parallel branch and cut algorithms to solve it. In this book, we present two new LP constraints: cutsec constraints and strong incompatibility constraints allow us to greatly reduce the time to solve the problem. We also present a message passing parallel algorithm to solve large problem instances in an heterogenous computing environment.

Note: Product cover images may vary from those shown

Nahit, Emanet.
Nahit Emanet obtained his PhD in Computer Engineering at Bogazici University, Istanbul, Turkey. He is currently an Assistant Professor in the Computer Engineering department at Fatih University. His research interests are primarily in the areas of algorithms, embedded and real-time systems, computer graphics, and pattern recognition.

Note: Product cover images may vary from those shown
Note: Product cover images may vary from those shown

Our Clients

Intel Corporation Autodesk, Inc. Hewlett-Packard Company Ahlstrom Corporation SAP SE 3M Company Samsung Group Ltd.