A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing

DOI10.1016/j.jda.2007.08.003zbMath1176.90612OpenAlexW2082473446MaRDI QIDQ1044022

Dieter Rautenbach, Jens Vygen, Sven Peyer

Publication date: 10 December 2009

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2007.08.003

zbMATH Keywords

VLSI routingDijkstra's algorithmphysical design

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Traffic problems in operations research (90B20)

Related Items

A survey of the all-pairs shortest paths problem and its variants in graphs ⋮ Faster goal-oriented shortest path search for bulk and incremental detailed routing ⋮ Joint chance constrained shortest path problem with Copula theory ⋮ A novel approach for modeling order picking paths ⋮ Two new bidirectional search algorithms ⋮ Simulation research of space-time evolution of emergency logistics network reliability based on complex network theory

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Shortest paths in Euclidean graphs
• Shortest paths algorithms: Theory and experimental evaluation
• Undirected single-source shortest paths with positive integer weights in linear time
• The shortest path problem on large-scale real-road networks
• Combining speed-up techniques for shortest-path computations
• Speed-Up Techniques for Shortest-Path Computations
• The Lee Path Connection Algorithm
• Some Variations of Lee's Algorithm
• A survey on multi-net global routing for integrated circuits
• Fibonacci heaps and their uses in improved network optimization algorithms
• SHARC
• Algorithms – ESA 2005
• Experimental and Efficient Algorithms
• Experimental and Efficient Algorithms
• Integer Programming and Combinatorial Optimization
• Algorithms - ESA 2003

This page was built for publication: A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing