Issue No. 11 - November (1998 vol. 47)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.736445
<p><b>Abstract</b>—This paper provides a very simple two-approximation algorithm for two NP-hard problems that arise in electronic circuit design. To our knowledge, this is the best approximation bound known for these problems. In addition, the simplicity of the proposed algorithm makes it attractive for real-time applications for similar problems in areas such as telecommunications and parallel processing.</p>
Graph embedding, approximation algorithms, moat routing.
I. Saniee, T. Carpenter, S. Cosares and J. L. Ganley, "A Simple Approximation Algorithm for Two Problems in Circuit Design," in IEEE Transactions on Computers, vol. 47, no. , pp. 1310-1312, 1998.