Equispreading tree in Manhattan distance

DOI10.1007/BF01955680zbMath0858.68116OpenAlexW1983530612MaRDI QIDQ1924408

Masato Edahiro

Publication date: 16 October 1996

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01955680

zbMATH Keywords

Manhattan distancea Steiner treeequispreading treeVLSI clock design

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• The rectilinear Steiner arborescence problem
• Zero skew clock routing with minimum wirelength
• Unnamed Item