首页   按字顺浏览 期刊浏览 卷期浏览 Faster exact algorithms for steiner trees in planar networks
Faster exact algorithms for steiner trees in planar networks

 

作者: Marshall Bern,  

 

期刊: Networks  （WILEY Available online 1990）
卷期: Volume 20, issue 1  

页码: 109-120

 

ISSN:0028-3045

 

年代: 1990

 

DOI:10.1002/net.3230200110

 

出版商: Wiley Subscription Services, Inc., A Wiley Company

 

数据来源: WILEY

 

摘要:

AbstractWe improve the time and space complexities of dynamic programming algorithms that compute optimal Steiner trees spanning nodes in planar networks. Our algorithms have special application to the rectilinear Steiner problem.

 

点击下载:  PDF (739KB)



返 回