A PSO-based timing-driven octilinear Steiner tree algorithm for VLSI routing considering bend reduction

DOI10.1007/S00500-014-1329-2zbMATH Open1382.68015OpenAlexW1982719471MaRDI QIDQ1708730FDOQ1708730

Authors: Yuzhen Niu, Xing Huang, Geng-Geng Liu, Wenzhong Guo, Guolong Chen 

Publication date: 26 March 2018

Published in: Soft Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00500-014-1329-2

Recommendations

• Shortest paths and Steiner trees in VLSI routing
• scientific article; zbMATH DE number 219265
• Routing vertex disjoint Steiner-trees in a cubic grid and connections to VLSI
• Approximation of Octilinear Steiner Trees Constrained by Hard and Soft Obstacles
• Preprocessing Steiner problems from VLSI layout
• Publication:3210200
• The Steiner tree packing problem in VLSI design
• Efficient optimization by modifying the objective function: applications to timing-driven VLSI layout

zbMATH Keywords

particle swarm optimization (PSO)timing delaynumber of bendsoctilinear Steiner tree (OST)performance-driven routingvery large scale integration (VLSI)

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Mathematical problems of computer architecture (68M07)

Cites Work

• The Rectilinear Steiner Tree Problem is $NP$-Complete
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A survey on multi-net global routing for integrated circuits
• Title not available (Why is that?)

Cited In (1)

• Accelerated high-dimensional global optimization: a particle swarm optimizer incorporating homogeneous learning and autophagy mechanisms

Uses Software

• OR-Library
• SPEA2

This page was built for publication: A PSO-based timing-driven octilinear Steiner tree algorithm for VLSI routing considering bend reduction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1708730)