ACO-Steiner: Ant Colony Optimization Based Rectilinear Steiner Minimal Tree Algorithm
- 1 January 2006
- journal article
- Published by Springer Nature in Journal of Computer Science and Technology
- Vol. 21 (1) , 147-152
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- UTACO: A Unified Timing and Congestion Optimization Algorithm for Standard Cell Global RoutingIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2004
- CNB: A critical-network-based timing optimization method for standard cell global routingJournal of Computer Science and Technology, 2003
- SSTT: Efficient local search for GSI global routingJournal of Computer Science and Technology, 2003
- An efficient hierarchical timing-driven Steiner tree algorithm for global routingIntegration, 2003
- Ant system: optimization by a colony of cooperating agentsIEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 1996
- A global router with a theoretical bound on the optimal solutionIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1996
- An edge-based heuristic for Steiner routingIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1994
- A new class of iterative Steiner tree heuristics with good performanceIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1992
- The Rectilinear Steiner Tree Problem is $NP$-CompleteSIAM Journal on Applied Mathematics, 1977
- On Steiner’s Problem with Rectilinear DistanceSIAM Journal on Applied Mathematics, 1966