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

DOI10.1007/s10107-023-01962-4MaRDI QIDQ6589742

Jens Vygen, Markus Ahrens, Dorothee Henke, Stefan Rabenstein

Publication date: 20 August 2024

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

shortest pathsdistance to the targetsVLSI detailed routing

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Combinatorial optimization (90C27) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational methods for problems pertaining to geometry (51-08)

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