首页> 外文会议>International symposium on Physical design >Efficient heuristics for the minimum shortest path Steiner arborescence problem with applications to VLSI physical design

【24h】

Efficient heuristics for the minimum shortest path Steiner arborescence problem with applications to VLSI physical design

机译：用于最小最短路径Steiner树状化问题的高效启发式方法及其在VLSI物理设计中的应用

获取原文

页面导航

著录项
相似文献
相关主题

著录项

来源
《International symposium on Physical design》|1997年|P.88-95|共8页
会议地点
作者
Jason Cong; Andrew B. Kahng; Kwok-Shing Leung;
展开▼
作者单位

展开▼
会议组织
原文格式 PDF
正文语种
中图分类半导体技术;
关键词

相似文献

外文文献
中文文献
专利

1. Efficient algorithms for the minimum shortest path Steiner arborescence problem with applications to VLSI physical design [J] . Cong J., Kahng A.B. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems . 1998,第1期

机译：最小最短路径斯坦纳树状化问题的高效算法及其在VLSI物理设计中的应用
2. New approximations for the rectilinear Steiner arborescence problem [VLSI layout] [J] . Ramnath S. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems . 2003,第7期

机译：直线Steiner树状化问题的新近似值[VLSI布局]
3. Application of the support vector machine and heuristic k-shortest path algorithm to determine the most eco-friendly path with a travel time constraint [J] . Zeng Weiliang, Miwa Tomio, Morikawa Takayuki Transportation Research . 2017,第deca期

机译：支持向量机和启发式k最短路径算法在确定具有旅行时间约束的最环保路径中的应用
4. Trees of Shortest Paths vs. Steiner Trees: Understanding and Improving Delete Relaxation Heuristics [C] . Emil Keyder, Hector Geffner International joint conference on artificial intelligence;IJCAI-09 . 2009

机译：最短路径树与Steiner树：了解和改进删除松弛启发式方法
5. The multiobjective average network flow problem: Shortest path and minimum cost flow formulations, algorithms, heuristics, and complexity. [D] . Jordan, Jeremy D. 2012

机译：多目标平均网络流量问题：最短路径和最低成本的流量公式，算法，启发式方法和复杂性。
6. Multi-start heuristic approaches for one-to-one pickup and delivery problems with shortest-path transport along real-life paths [O] . Xin Qi, Zhuo Fu, Jian Xiong, 2020

机译：沿着现实路径的最短路径运输的一对一取货和交付问题的多启动启发式方法
7. EFFICIENT HEURISTICS FOR THE MINIMUM SHORTEST PATH STEINER ARBORESCENCE PROBLEM WITH APPLICATIONS TO VLSI PHYSICAL DESIGN [O] . Jason Cong Z, Andrew B. Kahng Yz, Kwok-shing Leung Yz 2011

机译：最小最短路径Steerner到达性问题的有效启发式及其在VLSI物理设计中的应用
8. Average Network Flow Problem: Shortest Path and Minimum Cost Flow Formulations, Algorithms, Heuristics, and Complexity. [R] . Jordan, J. D. 2012

机译：平均网络流量问题：最短路径和最小成本流量公式，算法，启发式和复杂性。

Efficient heuristics for the minimum shortest path Steiner arborescence problem with applications to VLSI physical design

著录项

相似文献

相关主题

期刊订阅