THE RECTILINEAR STEINER TREE PROBLEM - Emanet, Nahit
32,99 €
inkl. MwSt.
Versandkostenfrei*
Versandfertig in 6-10 Tagen
  • Broschiertes Buch

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.

Andere Kunden interessierten sich auch für
Produktbeschreibung
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.
Autorenporträt
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.