共 50 条
- [2] Constructing minimal spanning Steiner trees with bounded path length [J]. EUROPEAN DESIGN & TEST CONFERENCE 1996 - ED&TC 96, PROCEEDINGS, 1996, : 244 - 249
- [3] Constructing minimal spanning trees with lower and upper bounded path delays [J]. ISCAS 96: 1996 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS - CIRCUITS AND SYSTEMS CONNECTING THE WORLD, VOL 4, 1996, : 416 - 419
- [4] Approximation algorithms for constructing spanning K-trees using stock pieces of bounded length [J]. Optimization Letters, 2017, 11 : 1663 - 1675
- [9] Approximating hexagonal Steiner minimal trees by fast optimal layout of minimum spanning trees [J]. Proc IEEE Int Conf Comput Des VLSI Comput Process, (392-398):
- [10] A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks [J]. Combinatorica, 2012, 32 : 1 - 33