Shouvik Chowdhury

Learn More
The rectilinear Steiner tree problem (RSTP) is a classical problem having numerous real-world applications, including VLSI routing. Since the RSTP is NP-hard, developing polynomial heuristics which can produce near optimal solutions has been the primary approach to solve the RSTP. Many of these algorithms (e.g., 1-Steiner) use Hanan points. However,(More)
  • 1