Publication | Closed Access

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

Mathematical ProgrammingNetwork Routing AlgorithmShortest Path AlgorithmEngineeringRoute PlanningNetwork RoutingComputer EngineeringRoutingNetwork AnalysisComputational ComplexityEducationScalable RoutingComputer ScienceDiscrete MathematicsCombinatorial OptimizationRouting Protocol