On Steiner’s Problem with Rectilinear Distance

Previous article Next article On Steiner’s Problem with Rectilinear DistanceM. HananM. Hananhttps: //doi. org/10. 1137/0114025PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAbout1 Claude Berge, The Theory of Graphs, John Wiley, New York, 1961 0097. 38903 Google Scholar2 Richard Courant and, Herbert Robbins, What Is Mathematics? , Oxford University Press, New York, 1941xix+521 MR0005358 0060. 12302 Google Scholar3 Richard L. Francis, A note on the optimum location of new machines in existing plant layouts, J. Indust. Engrg. , 14 (1963), 57–59 Google Scholar4 Hua Lo-Keng, Application of mathematical methods to wheat harvesting, Chinese Math. , 2 (1962), 77–91 Google Scholar5 Joseph B. Kruskal, Jr. , On the shortest spanning subtree of a graph and the traveling salesman problem, Proc. Amer. Math. Soc. , 7 (1956), 48–50 MR0078686 0070. 18404 CrossrefGoogle Scholar6 Z. A. Melzak, On the problem of Steiner, Canad. Math. Bull. , 4 (1961), 143–148 MR0125466 0101. 13201 CrossrefGoogle Scholar7 F. P. Palermo, A network minimization problem, IBM J. Res. Develop. , 5 (1961), 335–337 0101. 13202 CrossrefISIGoogle Scholar8 R. C. Prim, Shortest connecting networks, Bell System Tech. J. , 31 (1952), 1398–1401 Google Scholar Previous article Next article FiguresRelatedReferencesCited ByDetails QuCTS—Single-Flux Quantum Clock Tree SynthesisIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, Vol. 41, No. 10 | 1 Oct 2022 Cross Ref Topological Structure and Physical Layout Co-Design for Wavelength-Routed Optical Networks-on-ChipIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, Vol. 41, No. 7 | 1 Jul 2022 Cross Ref Optimal Picking Policies in E-Commerce WarehousesManagement Science, Vol. 53 | 24 March 2022 Cross Ref Approximation algorithms for Steiner forest: An experimental studyNetworks, Vol. 79, No. 2 | 13 May 2021 Cross Ref VLSI Routing Optimization Using Hybrid PSO Based on Reinforcement Learning2022 IEEE VLSI Device Circuit and System (VLSI DCS) | 26 Feb 2022 Cross Ref Global RoutingVLSI Physical Design: From Graph Partitioning to Timing Closure | 15 June 2022 Cross Ref REST: Constructing Rectilinear Steiner Minimum Tree via Reinforcement Learning2021 58th ACM/IEEE Design Automation Conference (DAC) | 5 Dec 2021 Cross Ref Itinerary planning for cooperative truck platooningTransportation Research Part B: Methodological, Vol. 153 | 1 Nov 2021 Cross Ref A multi-periods offshore wind farm optimization method for supplying energy in a natural gas hydrates exploitation platformJournal of Cleaner Production, Vol. 316 | 1 Sep 2021 Cross Ref Wire length optimization of VLSI circuits using IWO algorithm and its hybridCircuit World, Vol. 6 | 1 July 2021 Cross Ref Minimizing Wirelength with Bend Reduction using Gradient Descent PSO Hybrid in VLSI Global Routing2021 Devices for Integrated Circuit (DevIC) | 19 May 2021 Cross Ref SCIP-Jack: An Exact High Performance Solver for Steiner Tree Problems in Graphs and Related ProblemsModeling, Simulation and Optimization of Complex Processes HPSC 2018 | 2 December 2020 Cross Ref A layout design method for an industrial park based on a novel arrangement algorithm – Consideration of pipe network and multiple hazard sourcesChemical Engineering Science, Vol. 227 | 1 Dec 2020 Cross Ref A diameter-based model of the rectilinear partitioning problem in VLSI physical design2020 Chinese Automation Congress (CAC) | 6 Nov 2020 Cross Ref Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossibleTheoretical Computer Science, Vol. 839 | 1 Nov 2020 Cross Ref GPSO Hybrid Algorithm for Rectilinear Steiner Tree Optimization2020 IEEE VLSI DEVICE CIRCUIT AND SYSTEM (VLSI DCS) | 1 Jul 2020 Cross Ref Construction of All Rectilinear Steiner Minimum Trees on the Hanan Grid and Its Applications to VLSI DesignIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, Vol. 39, No. 6 | 1 Jun 2020 Cross Ref SALT: Provably Good Routing Topology by a Novel Steiner Shallow-Light Tree AlgorithmIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, Vol. 39, No. 6 | 1 Jun 2020 Cross Ref A Global Routing Method for Graphene Nanoribbons Based Circuits and InterconnectsACM Journal on Emerging Technologies in Computing Systems, Vol. 16, No. 3 | 19 May 2020 Cross Ref Images of Linear Conditions on a Manhattan PlaneGeometry & Graphics | 13 Apr 2020 Cross Ref Rectilinear Steiner Tree Construction Techniques Using PB-SAT-Based MethodologyJournal of Circuits, Systems and Computers, Vol. 29, No. 04 | 5 July 2019 Cross Ref Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence ProblemsACM Transactions on Algorithms, Vol. 16, No. 2 | 5 Mar 2020 Cross Ref PORA: A Physarum-inspired obstacle-avoiding routing algorithm for integrated circuit designApplied Mathematical Modelling, Vol. 78 | 1 Feb 2020 Cross Ref A New Global Routing Optimization Algorithm based on Pigeon Inspired Optimization2020 IEEE Calcutta Conference (CALCON) | 1 Feb 2020 Cross Ref An Efficient Rectilinear and Octilinear Steiner Minimal Tree Algorithm for Multidimensional EnvironmentsIEEE Access, Vol. 8 | 1 Jan 2020 Cross Ref Novel Approach for Steiner Nodes Filtration in VLSI Global Routing2019 International Conference on Intelligent Computing and Remote Sensing (ICICRS) | 19 Jul 2019 Cross Ref On Trade-off Between Static and Dynamic Power Consumption in NoC Power Gating2019 IEEE/ACM International Symposium on Low Power Electronics and Design (ISLPED) | 1 Jul 2019 Cross Ref An Augmented Line Segment-Based Algorithm with Delayed Overlap Consideration and Reconfigurable Logic for RSMT ProblemInternational Conference on Computer Networks and Communication Technologies | 18 September 2018 Cross Ref Research Project to Introduce MORE Fuzzy Distance: ‘Distance Between Points in Facility Layout Problem’SSRN Electronic Journal | 1 Jan 2019 Cross Ref Optimizing Costs and Quality of Interior Lighting by Genetic AlgorithmComputational Intelligence | 30 May 2019 Cross Ref The GeoSteiner software package for computing Steiner trees in the plane: an updated computational studyMathematical Programming Computation, Vol. 10, No. 4 | 20 February 2018 Cross Ref Planar Bus GraphsAlgorithmica, Vol. 80, No. 8 | 16 May 2017 Cross Ref A Maze Routing-Based Methodology With Bounded Exploration and Path-Assessed Retracing for Constrained Multilayer Obstacle-Avoiding Rectilinear Steiner Tree ConstructionACM Transactions on Design Automation of Electronic Systems, Vol. 23, No. 4 | 20 Jul 2018 Cross Ref A simple proof that the (n2 − 1) -puzzle is hardTheoretical Computer Science, Vol. 732 | 1 Jul 2018 Cross Ref Minimum rectilinear Steiner tree of n points in the unit squareComputational Geometry, Vol. 68 | 1 Mar 2018 Cross Ref Glossary of Mathematical Optimization TerminologyMathematical Optimization Terminology | 1 Jan 2018 Cross Ref Netzwerk-Design-ProblemeKombinatorische Optimierung | 25 July 2018 Cross Ref Combinatorial Distance Geometry in Normed SpacesNew Trends in Intuitive Geometry | 3 November 2018 Cross Ref Network Design ProblemsCombinatorial Optimization | 14 March 2018 Cross Ref K-nearest neighbour (KNN) approach using SAT based technique for rectilinear steiner tree construction2017 7th International Symposium on Embedded Computing and System Design (ISED) | 1 Dec 2017 Cross Ref Anchored rectangle and square packingsDiscrete Optimization, Vol. 26 | 1 Nov 2017 Cross Ref SALT: Provably good routing topology by a novel steiner shallow-light tree algorithm2017 IEEE/ACM International Conference on Computer-Aided Design (ICCAD) | 1 Nov 2017 Cross Ref Real Options Analysis of CO2 Transport and Storage in the UK Continental Shelf under Geological and Market Uncertainties and the Viability of Subsidies for Market DevelopmentEnergy Procedia, Vol. 114 | 1 Jul 2017 Cross Ref Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithmMathematical Programming Computation, Vol. 9, No. 2 | 14 July 2016 Cross Ref SCIP-Jack—a solver for STP and variants with parallelization extensionsMathematical Programming Computation, Vol. 9, No. 2 | 2 December 2016 Cross Ref Optimization design of coalbed methane pipeline network–coupled wellbore/reservoir simulationAdvances in Mechanical Engineering, Vol. 9, No. 6 | 20 June 2017 Cross Ref Steiner Trees with Bounded RC-DelayAlgorithmica, Vol. 78, No. 1 | 27 April 2016 Cross Ref Two-level rectilinear Steiner treesComputational Geometry, Vol. 61 | 1 Feb 2017 Cross Ref Benchmarking of Mask Fracturing HeuristicsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, Vol. 36, No. 1 | 1 Jan 2017 Cross Ref Экстремальные сети на -нормированной плоскости, где =3, 4, 6Математический сборник, Vol. 208, No. 4 | 1 Jan 2017 Cross Ref ReferencesThree-Dimensional Integrated Circuit Design | 1 Jan 2017 Cross Ref Augmented line segment based algorithm for constructing rectilinear steiner minimum tree2016 International Conference on Communication and Electronics Systems (ICCES) | 1 Oct 2016 Cross Ref A heuristic for constructing a rectilinear Steiner tree by reusing routing resources over obstaclesIntegration, the VLSI Journal, Vol. 55 | 1 Sep 2016 Cross Ref FH-OAOSACM Transactions on Design Automation of Electronic Systems, Vol. 21, No. 3 | 26 Jul 2016 Cross Ref RoutingElectronic Design Automation for IC Implementation, Circuit Design, and Process Technology | 14 April 2016 Cross Ref Optimization framework for topology design challenges in tactical smart microgrid planning2016 IEEE Power and Energy Conference at Illinois (PECI) | 1 Feb 2016 Cross Ref Delay Estimates for Graphene NanoribbonsProceedings of the 26th edition on Great Lakes Symposium on VLSI - GLSVLSI '16 | 1 Jan 2016 Cross Ref Automated Routing for VLSI: Kuh's Group ContributionsIEEE Circuits and Systems Magazine, Vol. 16, No. 2 | 1 Jan 2016 Cross Ref GlobalverdrahtungLayoutsynthese elektronischer Schaltungen | 28 May 2016 Cross Ref SAT based rectilinear steiner tree construction2016 2nd International Conference on Applied and Theoretical Computing and Communication Technology (iCATccT) | 1 Jan 2016 Cross Ref Physical design automation of transistor networksMicroelectronic Engineering, Vol. 148 | 1 Dec 2015 Cross Ref The vehicle platooning problem: Computational complexity and heuristicsTransportation Research Part C: Emerging Technologies, Vol. 60 | 1 Nov 2015 Cross Ref Key-node-based local search discrete artificial bee colony algorithm for obstacle-avoiding rectilinear Steiner tree constructionNeural Computing and Applications, Vol. 26, No. 4 | 1 November 2014 Cross Ref Routability-driven floorplanning algorithm for mixed-size modules with fixed-outline constraintVLSI Design, Automation and Test (VLSI-DAT) | 1 Apr 2015 Cross Ref A multi-objective approach for determining optimal air compressor location in a manufacturing facilityJournal of Manufacturing Systems, Vol. 35 | 1 Apr 2015 Cross Ref Obstacle-Avoiding Algorithm in X-Architecture Based on Discrete Particle Swarm Optimization for VLSI DesignACM Transactions on Design Automation of Electronic Systems, Vol. 20, No. 2 | 2 Mar 2015 Cross Ref Speeding Up Dynamic Programming with Representative Sets: An Experimental Evaluation of Algorithms for Steiner Tree on Tree DecompositionsAlgorithmica, Vol. 71, No. 3 | 29 August 2014 Cross Ref Fast obstacle-avoiding octilinear steiner minimal tree construction algorithm for VLSI designSixteenth International Symposium on Quality Electronic Design | 1 Mar 2015 Cross Ref The k-Nearest-Neighbor Voronoi Diagram RevisitedAlgorithmica, Vol. 71, No. 2 | 13 July 2013 Cross Ref SFB-ACO for Submicron VLSI Routing Optimization with Timing ConstraintsConfigurable Intelligent Optimization Algorithm | 19 August 2014 Cross Ref Rectilinear Steiner TreesOptimal Interconnection Trees in the Plane | 1 Jan 2015 Cross Ref Steiner Trees with Bounded RC-DelayApproximation and Online Algorithms | 23 April 2015 Cross Ref The Rectilinear Steiner Tree Problem with Given Topology and Length RestrictionsComputing and Combinatorics | 24 June 2015 Cross Ref Generalized Hanan Grids for Geometric Steiner Trees in Uniform Orientation MetricsGems of Combinatorial Optimization and Graph Algorithms | 12 January 2016 Cross Ref Efficient Multilayer Obstacle-Avoiding Rectilinear Steiner Tree Construction Based on Geometric ReductionIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, Vol. 33, No. 12 | 1 Dec 2014 Cross Ref Timing-driven Steiner tree construction on uniform λ-geometry18th International Symposium on VLSI Design and Test | 1 Jul 2014 Cross Ref On the history of the Euclidean Steiner tree problemArchive for History of Exact Sciences, Vol. 68, No. 3 | 27 August 2013 Cross Ref Watchman routes for lines and line segmentsComputational Geometry, Vol. 47, No. 4 | 1 May 2014 Cross Ref THE MINIMUM GUARDING TREE PROBLEMDiscrete Mathematics, Algorithms and Applications, Vol. 06, No. 01 | 18 February 2014 Cross Ref Algorithm for the construction of Rectilinear Steiner Minimum Tree by identifying the clusters of pointsInternational Conference on Information Communication and Embedded Systems (ICICES2014) | 1 Feb 2014 Cross Ref Rectilinear paths with minimum segment lengthsDiscrete Applied Mathematics, Vol. 161, No. 12 | 1 Aug 2013 Cross Ref Phylogenetic analysis of multiprobe fluorescence in situ hybridization data from tumor cell populationsBioinformatics, Vol. 29, No. 13 | 19 June 2013 Cross Ref BonnRouteACM Transactions on Design Automation of Electronic Systems, Vol. 18, No. 2 | 1 Mar 2013 Cross Ref New variations of the maximum coverage facility location problemEuropean Journal of Operational Research, Vol. 224, No. 3 | 1 Feb 2013 Cross Ref On the Characterization of Plane Bus GraphsAlgorithms and Complexity | 1 Jan 2013 Cross Ref On the Construction of Generalized Voronoi Inverse of a Rectangular TessellationTransactions on Computational Science XX | 1 Jan 2013 Cross Ref Speeding Up Dynamic Programming with Representative SetsParameterized and Exact Computation | 1 Jan 2013 Cross Ref Cellular SDS Algorithm for the Rectilinear Steiner Minimum Tree2012 Third International Conference on Digital Manufacturing & Automation | 1 Jul 2012 Cross Ref Obstacle-Avoiding Rectilinear Steiner Tree Construction: A Steiner-Point-Based AlgorithmIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, Vol. 31, No. 7 | 1 Jul 2012 Cross Ref A Delaunay triangulation-based shortest path algorithm with O (n log n) time in the Euclidean plane2012 IEEE/ASME International Conference on Advanced Intelligent Mechatronics (AIM) | 1 Jul 2012 Cross Ref On the Construction of a Generalized Voronoi Inverse of a Rectangular Tessellation2012 Ninth International Symposium on Voronoi Diagrams in Science and Engineering | 1 Jun 2012 Cross Ref Using Run-Time Reconfiguration to Implement Fault-Tolerant Coarse Grained Reconfigurable Architectures2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum | 1 May 2012 Cross Ref COMPUTING THE STRETCH FACTOR AND MAXIMUM DETOUR OF PATHS, TREES, AND CYCLES IN THE NORMED SPACEInternational Journal of Computational Geometry & Applications, Vol. 22, No. 01 | 12 September 2012 Cross Ref Network Design ProblemsCombinatorial Optimization | 27 October 2011 Cross Ref Netzwerk-Design-ProblemeKombinatorische Optimierung | 4 May 2012 Cross Ref Spanning trees set synthesis algorithm for custom VLSI global routingRussian Microelectronics, Vol. 40, No. 7 | 4 December 2011 Cross Ref APPROXIMATION ALGORITHMS FOR BUY-AT-BULK GEOMETRIC NETWORK DESIGNInternational Journal of Foundations of Computer Science, Vol. 22, No. 08 | 6 April 2012 Cross Ref Spatial and Temporal Data Path Remapping for Fault-Tolerant Coarse-Grained Reconfigurable Architectures2011 IEEE International Symposium on Defect and Fault Tolerance in VLSI and Nanotechnology Systems | 1 Oct 2011 Cross Ref A template router2011 20th European Conference on Circuit Theory and Design (ECCTD) | 1 Aug 2011 Cross Ref DPSO-based Rectilinear Steiner Minimal Tree construction considering bend reduction2011 Seventh International Conference on Natural Computation | 1 Jul 2011 Cross Ref On the Construction of Optimal Obstacle-Avoiding Rectilinear Steiner Minimum TreesIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, Vol. 30, No. 5 | 1 May 2011 Cross Ref Dealing with large hidden constantsACM Journal of Experimental Algorithmics, Vol. 16 | 1 May 2011 Cross Ref Global RoutingVLSI Physical Design: From Graph Partitioning to Timing Closure | 27 January 2011 Cross Ref An Output-Sensitive Approach for the L 1/L ∞ k-Nearest-Neighbor Voronoi DiagramAlgorithms – ESA 2011 | 1 Jan 2011 Cross Ref Problemi di progettazione di retiOttimizzazione Combinatoria | 1 Jan 2011 Cross Ref The word and geodesic problems in free solvable groupsTransactions of the American Mathematical Society, Vol. 362, No. 9 | 14 April 2010 Cross Ref A near linear time approximation scheme for Steiner tree among obstacles in the planeComputational Geometry, Vol. 43, No. 4 | 1 May 2010 Cross Ref Blockage-avoiding buffered clock-tree synthesis for clock latency-range and skew minimization2010 15th Asia and South Pacific Design Automation Conference (ASP-DAC) | 1 Jan 2010 Cross Ref Problémes de conception de réseauxOptimisation combinatoire | 1 Jan 2010 Cross Ref A VLSI routing algorithm based on improved DPSO2009 IEEE International Conference on Intelligent Computing and Intelligent Systems | 1 Nov 2009 Cross Ref Maze Routing Steiner Trees With Delay Versus Wire Length TradeoffIEEE Transactions on Very Large Scale Integration (VLSI) Systems, Vol. 17, No. 8 | 1 Aug 2009 Cross Ref Applications of network coding in global routing2009 IEEE International Conference on IC Design and Technology | 1 May 2009 Cross Ref Archer: A History-Based Global Routing AlgorithmIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, Vol. 28, No. 4 | 1 Apr 2009 Cross Ref Thermal aware placement in 3D ICs using quadratic uniformity modeling approachIntegration, the VLSI Journal, Vol. 42, No. 2 | 1 Feb 2009 Cross Ref Weighted Lee Algorithm on Rectilinear Steiner Tree with Obstacles and Boundary2009 WRI World Congress on Computer Science and Information Engineering | 1 Jan 2009 Cross Ref Maximum Parsimony for Tree MixturesIEEE/ACM Transactions on Computational Biology and Bioinformatics, Vol. 6, No. 1 | 1 Jan 2009 Cross Ref Global and detailed routingElectronic Design Automation | 1 Jan 2009 Cross Ref Steiner trees for fixed orientation metricsJournal of Global Optimization, Vol. 43, No. 1 | 15 April 2008 Cross Ref EBOARST: An Efficient Edge-Based Obstacle-Avoiding Rectilinear Steiner Tree Construction AlgorithmIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, Vol. 27, No. 12 | 1 Dec 2008 Cross Ref MaizeRouter: Engineering an Effective Global RouterIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, Vol. 27, No. 11 | 1 Nov 2008 Cross Ref A Distributed Heuristic Algorithm for the Rectilinear Steiner Minimal Tree Transactions on Computer-Aided Design of Integrated Circuits and Systems, Vol. 27, No. 11 | 1 Nov 2008 Cross Ref Global optimization with to design IEEE International Conference on Computer Design | 1 Oct 2008 Cross Ref With the Transactions on Vol. No. 3 | 1 Aug 2008 Cross Ref A Fast and to Global Routing Transactions on Computer-Aided Design of Integrated Circuits and Systems, Vol. 27, No. 4 | 1 Apr 2008 Cross Ref Engineering an global Asia and South Pacific Design Automation Conference | 1 Jan 2008 Cross Ref An Steiner tree based approach for Asia and South Pacific Design Automation Conference | 1 Jan 2008 Cross Ref Fast Based Rectilinear Steiner Minimal Tree Algorithm for VLSI DesignIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, Vol. 27, No. 1 | 1 Jan 2008 Cross Ref Physical Design and and Test in | 1 Jan 2008 Cross Ref Archer: a global routing IEEE/ACM International Conference on Computer-Aided Design | 1 Nov Cross Ref rectilinear Steiner minimal tree construction considering bend 7th International Conference on | 1 Oct Cross Ref Steiner Minimal Trees in Rectilinear and Octilinear Vol. 23, No. 9 | 31 January Cross Ref AND APPROXIMATION OF Journal of Computational Geometry & Applications, Vol. 17, No. | 20 November 2011 Cross Ref A Fast and Global Routing Asia and South Pacific Design Automation Conference | 1 Jan Cross Ref A Novel Topology Design Asia and South Pacific Design Automation Conference | 1 Jan Cross Ref A Fast and Using an Exact Linear Circuit | 1 Jan Cross Ref Fast and with an Exact Linear IEEE/ACM International Conference on Computer Design | 1 Nov Cross Ref A to Global Routing IEEE/ACM International Conference on Computer Design | 1 Nov Cross Ref A approach to Steiner Tree International Conference on Very Large Scale Integration | 1 Oct Cross Ref On the Complexity of of Computational Vol. No. 5 | 1 Jun Cross Ref Linear Programming for Global Journal on Vol. 18, No. 2 | 1 May Cross Ref Novel algorithms for placement of for in and VLSI design Transactions on Computer-Aided Design of Integrated Circuits and Systems, Vol. No. 1 | 1 Jan Cross Ref сборник, Vol. No. 5 | 1 Jan Cross Ref Optimization Based Rectilinear Steiner Minimal Tree of Computer Science and Vol. 21, No. 1 | 1 Jan Cross Ref Hybrid Algorithms for the Rectilinear Steiner Tree Problem Using Science and Its Applications - | 1 Jan Cross Ref On the Complexity of | 1 Jan Cross Ref Approximation Algorithms for Network Design and Facility with and Combinatorial Algorithms and Techniques | 1 Jan Cross Ref and Approximation of Octilinear Steiner and Computation | 1 Jan Cross Ref An Algorithm for the Rectilinear Steiner Tree Science and Its Applications – | 1 Jan Cross Ref Rectilinear Steiner Tree Construction Using Programming | 1 Jan Cross Ref an coding of spanning Transactions on Computation, Vol. No. 3 | 1 Jun Cross Ref Picking from of Computational Vol. 10, No. | 1 Jun Cross Ref сети Vol. No. 5 | 1 Jan Cross Ref Approximation of Rectilinear Steiner Trees with Length on and Data | 1 Jan Cross Ref Optimization of - ESA | 1 Jan Cross Ref approach to rectilinear Steiner tree Transactions on Very Large Scale Integration (VLSI) Systems, Vol. 10, No. 6 | 1 Dec Cross Ref Planar Manhattan Minimal and Journal of Vol. 23, No. 8 | 1 Nov Cross Ref Steiner Transactions on Computer-Aided Design of Integrated Circuits and Systems, Vol. 21, No. 11 | 1 Nov Cross Ref problem in Vol. No. 7 | 1 Oct Cross Ref Computing the shortest network under a fixed Transactions on Computers, Vol. No. 9 | 1 Sep Cross Ref Computing the shortest network under a fixed Transactions on Computers, Vol. No. 9 | 1 Sep Cross Ref A optimization algorithm for a rectilinear partitioning problem with in VLSI design Processing Vol. No. 1 | 1 Jul Cross Ref buffered routing tree Transactions on Computer-Aided Design of Integrated Circuits and Systems, Vol. 21, No. 5 | 1 May Cross Ref Vol. No. 5 | 1 Jan Cross Ref Network Design ProblemsCombinatorial Optimization | 1 Jan Cross Ref layout optimization under model for Transactions on Computer-Aided Design of Integrated Circuits and Systems, Vol. 20, No. 12 | 1 Dec Cross Ref A on global routing for integrated Vol. 31, No. 1 | 1 Nov Cross Ref of in the rectilinear Vol. No. 3 | 1 January Cross Ref A of Hanan Vol. No. 2 | 1 January Cross Ref Wire for based on Computer Science, Vol. No. | 1 Jul Cross Ref Steiner tree optimization for and Transactions on Computer-Aided Design of Integrated Circuits and Systems, Vol. 20, No. 4 | 1 Apr Cross Ref Optimal layout for Transactions on Vol. No. 1 | 1 Feb Cross Ref Exact location of the Steiner of the Steiner minimum tree in and in Electronic Vol. No. 2 | 1 January Cross Ref Exact location of the Steiner of the Steiner minimum tree in and in Electronic Vol. No. 2 | 1 January Cross Ref Algorithms for the Rectilinear Steiner Tree Trees in | 1 Jan Cross Ref Steiner Tree Problems in VLSI Layout Trees in | 1 Jan Cross Ref The Rectilinear Steiner Tree A Trees in | 1 Jan Cross Ref An on Steiner Tree Problems in Trees in | 1 Jan Cross Ref Steiner Minimum Trees in Uniform Orientation Trees in | 1 Jan Cross Ref Optimization for Global VLSI Optimization in VLSI Design | 1 Jan Cross Ref A new heuristic for rectilinear Steiner Transactions on Computer-Aided Design of Integrated Circuits and Systems, Vol. No. 10 | 1 Oct Cross Ref The local Steiner problem in Vol. 36, No. 2 | 1 January Cross Ref The local Steiner problem in Vol. 36, No. 2 | 1 January Cross Ref The local Steiner problem in Vol. 36, No. 2 | 1 January Cross Ref The local Steiner problem in Vol. 36, No. 2 | 1 January Cross Ref the Steiner problem in uniform Vol. No. 4 | 1 January Cross Ref the Steiner problem in uniform Vol. No. 4 | 1 January Cross Ref A steiner and Computer Modelling, Vol. 31, No. | 1 Mar Cross Ref Network to and new of the Optical of Vol. 17, No. 3 | 1 March Cross Ref Computing Shortest Networks with in Steiner Trees | 1 Jan Cross Ref Rectilinear Steiner Minimal Trees on Parallel in Steiner Trees | 1 Jan Cross Ref A algorithm for the minimum rectilinear steiner of Computer Science and Vol. No. 1 | 1 Jan Cross Ref Exact Algorithms for Plane Steiner Tree A Computational in Steiner Trees | 1 Jan Cross Ref Exact Steiner Trees in Graphs and Grid in Steiner Trees | 1 Jan Cross Ref Network Design ProblemsCombinatorial Optimization | 1 Jan Cross Ref for Systems on a | 1 Jan Cross Ref Circuit of and Electronics Engineering | 27 December Cross Ref for Layout Geometry of Rectilinear of Computing in Engineering, Vol. No. 4 | 1 Oct Cross Ref Transactions on Computer-Aided Design of Integrated Circuits and Systems, Vol. 18, No. 4 | 1 Apr Cross Ref algorithms and for layout Transactions on Computer-Aided Design of Integrated Circuits and Systems, Vol. 18, No. 4 | 1 Apr Cross Ref Rectilinear Steiner tree Vol. 33, No. 2 | 1 Mar Cross Ref Rectilinear Steiner tree Vol. 33, No. 2 |