Algorithms and Computation

DOI10.1007/11602613zbMath1173.68866OpenAlexW2304246803MaRDI QIDQ5897859

Matthias Müller-Hannemann, Anna Schulze

Publication date: 14 November 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

VLSI designNP-completenessapproximation algorithmsblockagesoctilinear Steiner trees

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (1)

Upward Planar Drawings with Three and More Slopes

This page was built for publication: Algorithms and Computation