A linear time algorithm for optimal routing around a rectangle
From MaRDI portal
Publication:3816979
DOI10.1145/48014.48018zbMath0665.68036OpenAlexW2078971298MaRDI QIDQ3816979
Sing-Ling Lee, Teofilo F. Gonzalez
Publication date: 1988
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/48014.48018
Analysis of algorithms and problem complexity (68Q25) Circuits, networks (94C99) Discrete mathematics in relation to computer science (68R99)
Related Items (4)
Improved approximation algorithms for embedding hyperedges in a cycle ⋮ An efficient one-side height minimization algorithm for routing around a rectangle ⋮ Algorithms for routing around a rectangle ⋮ On minimizing the maximum congestion for weighted hypergraph embedding in a cycle
This page was built for publication: A linear time algorithm for optimal routing around a rectangle