Approximation of Octilinear Steiner Trees Constrained by Hard and Soft Obstacles

DOI10.1007/11785293_24zbMath1141.68660OpenAlexW1535022566MaRDI QIDQ5757889

Anna Schulze, Matthias Müller-Hannemann

Publication date: 7 September 2007

Published in: Algorithm Theory – SWAT 2006 (Search for Journal in Brave)

Full work available at URL: http://e-archive.informatik.uni-koeln.de/545/2/zaik2007-545.pdf

zbMATH Keywords

VLSI designSteiner treesApproximation algorithmsobstaclesoctilinear routing

Mathematics Subject Classification ID

Approximation algorithms (68W25)

Related Items (1)

A near linear time approximation scheme for Steiner tree among obstacles in the plane

This page was built for publication: Approximation of Octilinear Steiner Trees Constrained by Hard and Soft Obstacles