Tell your friends about this item:
The Rectilinear Steiner Tree Problem: Sequential and Parallel Algorithms for the Rectilinear Steiner Tree Problem Nahit Emanet
The Rectilinear Steiner Tree Problem: Sequential and Parallel Algorithms for the Rectilinear Steiner Tree Problem
Nahit Emanet
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.
| Media | Books Paperback Book (Book with soft cover and glued back) |
| Released | June 29, 2010 |
| ISBN13 | 9783838349060 |
| Publishers | LAP Lambert Academic Publishing |
| Pages | 116 |
| Dimensions | 225 × 7 × 150 mm · 191 g |
| Language | German |
See all of Nahit Emanet ( e.g. Paperback Book )