Faster goal-oriented shortest path search for bulk and incremental detailed routing

DOI10.1007/978-3-031-06901-7_2zbMath1497.90207arXiv2111.06169OpenAlexW3214627062MaRDI QIDQ2164671

Dorothee Henke, Jens Vygen, Stefan Rabenstein, Markus Ahrens

Publication date: 16 August 2022

Full work available at URL: https://arxiv.org/abs/2111.06169

zbMATH Keywords

track assignmentglobal shortest path

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• A note on two problems in connexion with graphs
• Faster min-max resource sharing in theory and practice
• A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing
• Finding the intersection of n half-spaces in time O(n log n)
• Handbook of Algorithms for Physical Design Automation
• Optimal Point Location in a Monotone Subdivision
• Optimal Search in Planar Subdivisions
• The Lee Path Connection Algorithm
• RESTRICTED TRACK ASSIGNMENT WITH APPLICATIONS

This page was built for publication: Faster goal-oriented shortest path search for bulk and incremental detailed routing