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

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

Journal

Applied Mathematics and Computation
ISSN: 0096-3003 , E-ISSN: 1873-5649

Output data

Year: 2015, Volume: 255, Pages: 92-104 Pages count : 13 DOI: 10.1016/j.amc.2014.11.062

Tags

Elmore delay; Global routing; Gradient method; Steiner tree

Authors

Samanta Radhamanjari ¹ , Erzin Adil I. ^2,3 , Raha Soumyendu ¹ , Shamardin Yuriy V. ² , Takhonov Ivan I. ³ , Zalyubovskiy Vyacheslav V. ²

Affiliations

1	Indian Institute of Science Education and Research
2	Sobolev Institute of Mathematics
3	Novosibirsk State University

Samanta R. , Erzin A.I. , Raha S. , Shamardin Y.V. , Takhonov I.I. , Zalyubovskiy V.V.
A provably tight delay-driven concurrently congestion mitigating global routing algorithm
Applied Mathematics and Computation. 2015. V.255. P.92-104. DOI: 10.1016/j.amc.2014.11.062 WOS Scopus OpenAlex

Web of science:	WOS:000351676900011
Scopus:	2-s2.0-85027929987
OpenAlex:	W1966579699

DB	Citing
Scopus	8
OpenAlex	8
Web of science	8