Constructing minimal spanning/Steiner trees with bounded path length

被引：0

作者：

Univ of Southern California, Los Angeles, United States ^{[1
]}

机构：

来源：

Integr VLSI J | / 1-2卷 / 137-163期

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

共 50 条

[1] Constructing minimal spanning/Steiner trees with bounded path length
Oh, J
Pyo, I
Pedram, M
INTEGRATION-THE VLSI JOURNAL, 1997, 22 (1-2) : 137 - 163
[2] Constructing minimal spanning Steiner trees with bounded path length
Pyo, I
Oh, J
Pedram, M
EUROPEAN DESIGN & TEST CONFERENCE 1996 - ED&TC 96, PROCEEDINGS, 1996, : 244 - 249
[3] Constructing minimal spanning trees with lower and upper bounded path delays
Oh, J
Pyo, I
Pedram, M
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
Junran Lichen
Jianping Li
Ko-Wei Lih
Optimization Letters, 2017, 11 : 1663 - 1675
[5] Approximation algorithms for constructing spanning K-trees using stock pieces of bounded length
Lichen, Junran
Li, Jianping
Lih, Ko-Wei
OPTIMIZATION LETTERS, 2017, 11 (08) : 1663 - 1675
[6] DISTRIBUTED ALGORITHM FOR CONSTRUCTING MINIMAL SPANNING TREES.
Dalal, Yogen K.
IEEE Transactions on Software Engineering, 1987, SE-13 (03) : 398 - 405
[7] A DISTRIBUTED ALGORITHM FOR CONSTRUCTING MINIMAL SPANNING-TREES
DALAL, YK
IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1987, 13 (03) : 398 - 405
[8] Analysis of two sweep-line algorithms for constructing spanning trees and steiner trees
Dumitrescu, Adrian
Toth, Csaba D.
JOURNAL OF UNIVERSAL COMPUTER SCIENCE, 2007, 13 (11) : 1615 - 1627
[9] Approximating hexagonal Steiner minimal trees by fast optimal layout of minimum spanning trees
Univ of Vermont, Burlington, United States
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
Angel, Omer
Flaxman, Abraham D.
Wilson, David B.
COMBINATORICA, 2012, 32 (01) : 1 - 33

← 1 2 3 4 5 →