A provably tight delay-driven concurrently congestion mitigating global routing algorithm

DOI10.1016/j.amc.2014.11.062zbMath1338.90087OpenAlexW1966579699MaRDI QIDQ299423

Vyacheslav V. Zalyubovskiy, Ivan I. Takhonov, Radhamanjari Samanta, Yuriy V. Shamardin, Soumyendu Raha, Adil I. Erzin

Publication date: 22 June 2016

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2014.11.062

zbMATH Keywords

gradient methodSteiner treeelmore delayglobal routing

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Knapsack problem with objective value gaps ⋮ A provably tight delay-driven concurrently congestion mitigating global routing algorithm

Uses Software

• MaizeRouter
• TimberWolf

Cites Work

• A provably tight delay-driven concurrently congestion mitigating global routing algorithm
• Fault tolerant routing algorithm based on the artificial potential field model in network-on-chip
• The maximum concurrent flow problem

This page was built for publication: A provably tight delay-driven concurrently congestion mitigating global routing algorithm