.png){kind=icon}
返回
A simple approximation algorithm for two problems in circuit design
.png){kind=icon}
PRE
AI
DOI：10.1109/12.736445.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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.
Keyword:
graph embedding
approximation algorithms
moat routing
期刊
IF:
3.8
论文数:
5.4K
被引数:
9.8K
机构
暂无机构信息
.png){kind=icon}
没有更多内容