A $1.6$ Approximation Algorithm for Routing Multiterminal Nets
From MaRDI portal
Publication:3801063
DOI10.1137/0216046zbMath0654.68038OpenAlexW2058836520MaRDI QIDQ3801063
Sing-Ling Lee, Teofilo F. Gonzalez
Publication date: 1987
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0216046
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15)
Related Items (2)
Improved approximation algorithms for embedding hyperedges in a cycle ⋮ An efficient one-side height minimization algorithm for routing around a rectangle
This page was built for publication: A $1.6$ Approximation Algorithm for Routing Multiterminal Nets