Minimizing Wirelength in Zero and Bounded Skew Clock Trees

DOI10.1137/S0895480199352622zbMath1101.68114OpenAlexW2021692155MaRDI QIDQ4652609

Andrew Tomkins, Sridhar Rajagopalan, Amit Sahai, Ravi Kumar, Jon M. Kleinberg, Moses Charikar

Publication date: 28 February 2005

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0895480199352622

zbMATH Keywords

skewclock routingwirelength minimization

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35) Approximation algorithms (68W25) Randomized algorithms (68W20)