Approximation of Octilinear Steiner Trees Constrained by Hard and Soft Obstacles

DOI10.1007/11785293_24MaRDI QIDQ5757889zbMATH OpenOpenAlexFDO

Authors 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

Approximation algorithmsobstaclesoctilinear routingSteiner treesVLSI design

Mathematics Subject Classification ID

Approximation algorithms (68W25)

Recommendations

• Algorithms and Computation
• HARDNESS AND APPROXIMATION OF OCTILINEAR STEINER TREES
• Approximation of rectilinear Steiner trees with length restrictions on obstacles.
• Approximation algorithms for network design problems
• Steiner minimal trees in rectilinear and octilinear planes

Cited in

(6)

• A PSO-based timing-driven octilinear Steiner tree algorithm for VLSI routing considering bend reduction
• A near linear time approximation scheme for Steiner tree among obstacles in the plane
• Approximation algorithms for network design problems
• HARDNESS AND APPROXIMATION OF OCTILINEAR STEINER TREES
• Algorithms and Computation
• Approximation of rectilinear Steiner trees with length restrictions on obstacles.

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5757889)