×
Author ID: weng.jia-feng Recent zbMATH articles by "Weng, Jia Feng"
Published as: Weng, J. F.; Weng, Jia Feng; Weng, Jia F.; Weng, J.
Documents Indexed: 58 Publications since 1983
Co-Authors: 11 Co-Authors with 36 Joint Publications
426 Co-Co-Authors

Publications by Year

Citations contained in zbMATH Open

49 Publications have been cited 108 times in 61 Documents Cited by Year
Steiner minimal trees for regular polygons. Zbl 0607.05022
Du, D. Z.; Hwang, F. K.; Weng, J. F.
20
1987
Steiner minimal trees on zig-zag lines. Zbl 0523.51018
Du, Ding-Zhu; Hwang, F. K.; Weng, J. F.
17
1983
Gradient-constrained minimum networks. I: Fundamentals. Zbl 1068.90605
Brazil, M.; Rubinstein, J. H.; Thomas, D. A.; Weng, J. F.; Wormald, N. C.
13
2001
The shortest network under a given topology. Zbl 0764.68119
Hwang, F. K.; Weng, J. F.
11
1992
Minimum networks in uniform orientation metrics. Zbl 0973.05022
Brazil, M.; Thomas, D. A.; Weng, J. F.
9
2000
Canonical forms and algorithms for Steiner trees in uniform orientation metrics. Zbl 1095.68074
Brazil, M.; Thomas, D. A.; Weng, J. F.; Zachariasen, M.
9
2006
Minimum networks for four points in space. Zbl 1009.05042
Rubinstein, J. H.; Thomas, D. A.; Weng, J.
9
2002
Hexagonal coordinate systems and Steiner minimal trees. Zbl 0601.05016
Hwang, F. K.; Weng, J. F.
8
1986
Optimal detection of two defectives with a parity check device. Zbl 0643.90038
Chang, X. M.; Hwang, F. K.; Weng, J. F.
7
1988
Minimal Steiner trees for rectangular arrays of lattice points. Zbl 0883.05038
Brazil, M.; Rubinstein, J. H.; Thomas, D. A.; Weng, J. F.; Wormald, N. C.
6
1997
On the complexity of the Steiner problem. Zbl 1028.90045
Brazil, M.; Thomas, D. A.; Weng, J. F.
6
2000
Steiner minimal trees for a class of zigzag lines. Zbl 0756.05042
Booth, R. S.; Weng, J. F.
6
1992
Gradient-constrained minimum networks. II: Labelled or locally minimal Steiner points. Zbl 1168.90626
Brazil, M.; Thomas, D. A.; Weng, J. F.
6
2008
Variational approach and Steiner minimal trees on four points. Zbl 0808.05037
Weng, J. F.
6
1994
Minimal Steiner trees for \(2^ k \times 2^ k\) square lattices. Zbl 0844.05036
Brazil, M.; Cole, T.; Rubinstein, J. H.; Thomas, D. A.; Weng, J. F.; Wormald, N. C.
5
1996
Degree-five Steiner points cannot reduce network costs for planar sets. Zbl 0774.05032
Rubinstein, J. H.; Thomas, D. A.; Weng, J. F.
5
1992
Locally minimal uniformly oriented shortest networks. Zbl 1275.90114
Brazil, Marcus; Thomas, Doreen A.; Weng, Jia Feng
5
2006
Full minimal Steiner trees on lattice sets. Zbl 0874.05018
Brazil, M.; Rubinstein, J. H.; Thomas, D. A.; Weng, J. F.; Wormald, N. C.
4
1997
Upper and lower bounds for the lengths of Steiner trees in 3-space. Zbl 1068.05014
Brazil, M.; Thomas, D. A.; Weng, J. F.
4
2004
A class of full Steiner minimal trees. Zbl 0508.05029
Hwang, F. K.; Weng, Jia Feng; Du, Ding-Zhu
4
1983
Minimum cost flow-dependent communication networks. Zbl 1103.90031
Thomas, D. A.; Weng, J. F.
4
2006
Compression theorems and Steiner ratios on spheres. Zbl 0895.90173
Rubinstein, J. H.; Weng, J. F.
4
1997
Shortest networks for smooth curves. Zbl 0884.05036
Weng, J. F.
3
1997
Approximations and lower bounds for the length of minimal Euclidean Steiner trees. Zbl 1133.90408
Rubinstein, J. H.; Weng, J.; Wormald, N.
3
2006
Forbidden subpaths for Steiner minimum networks in uniform orientation metrics. Zbl 1014.68119
Brazil, M.; Thomas, D. A.; Weng, J. F.
3
2002
Gradient-constrained minimal Steiner trees. Zbl 0915.05042
Brazil, M.; Thomas, D. A.; Weng, J. F.
3
1998
Group testing with two and three defectives. Zbl 0800.62628
Chang, X. M.; Hwang, F. K.; Weng, J. F.
3
1989
Steiner trees on curved surfaces. Zbl 0982.05036
Weng, J. F.
2
2001
Expansion of linear Steiner trees. Zbl 0897.68077
Weng, J. F.
2
1997
Steiner polygons in the Steiner problem. Zbl 0808.51022
Weng, Jia Feng
2
1994
Rectilinear Steiner minimal trees on parallel lines. Zbl 0944.05020
Brazil, Marcus; Thomas, Doreen A.; Weng, Jia Feng
1
2000
Steiner trees, coordinate systems and NP-hardness. Zbl 0981.68120
Weng, J. F.
1
2000
Steiner minimal trees on regular polygons with centre. Zbl 0826.05024
Weng, J. F.; Booth, R. S.
1
1995
Steiner minimal trees with one polygonal obstacle. Zbl 1054.90064
Weng, J. F.; MacGregor Smith, J.
1
2001
Cost optimisation for underground mining networks. Zbl 1093.90067
Brazil, Marcus; Thomas, Doreen A.; Weng, Jia F.; Rubinstein, J. Hyam; Lee, David H.
1
2005
Pseudo-Gilbert-Steiner trees. Zbl 0923.05016
Trietsch, D.; Weng, J. F.
1
1999
Degenerate Gilbert-Steiner trees. Zbl 0765.90039
Weng, J. F.
1
1992
Computing Steiner points and probability Steiner points in \(\ell _{1}\) and \(\ell _{2}\) metric spaces. Zbl 1194.05020
Weng, J. F.; Mareels, I.; Thomas, D. A.
1
2009
Optimum Steiner ratio for gradient-constrained networks connecting three points in 3-space. I. Zbl 1200.90033
Prendergast, K.; Thomas, D. A.; Weng, J. F.
1
2009
Determining shortest networks in the Euclidean plane. Zbl 0796.05027
Weng, J. F.
1
1994
Equivalence, indicators, quasi-indicators and optimal Steiner topologies on four points in space. Zbl 1154.90018
Weng, J. F.; MacGregor Smith, J.; Brazil, M.; Thomas, D. A.
1
2008
Shortest networks on spheres. Zbl 0915.05043
Brazil, M.; Rubinstein, J. H.; Thomas, D. A.; Weng, J. F.; Wormald, N. C.
1
1998
Identifying Steiner minimal trees on four points in space. Zbl 1221.05063
Weng, J. F.; Thomas, D. A.; Mareels, I.
1
2009
An optimal group testing algorithm on \(k\) disjoint sets. Zbl 0773.90041
Weng, J. F.; Hwang, F. K.
1
1993
Exactly solvable and unsolvable shortest network problems in 3D-space. Zbl 1062.05037
Booth, R. S.; Thomas, D. A.; Weng, J. F.
1
2004
Generalized Melzak’s construction in the Steiner tree problem. Zbl 1045.05032
Weng, Jia F.
1
2002
Probability Steiner trees and maximum parsimony in phylogenetic analysis. Zbl 1279.92061
Weng, J. F.; Mareels, I.; Thomas, D. A.
1
2012
Euclidean Steiner trees optimal with respect to swapping 4-point subtrees. Zbl 1292.90306
Thomas, Doreen A.; Weng, Jia F.
1
2014
Computing Steiner points for gradient-constrained minimum networks. Zbl 1264.05134
Thomas, D. A.; Weng, J. F.
1
2010
Euclidean Steiner trees optimal with respect to swapping 4-point subtrees. Zbl 1292.90306
Thomas, Doreen A.; Weng, Jia F.
1
2014
Probability Steiner trees and maximum parsimony in phylogenetic analysis. Zbl 1279.92061
Weng, J. F.; Mareels, I.; Thomas, D. A.
1
2012
Computing Steiner points for gradient-constrained minimum networks. Zbl 1264.05134
Thomas, D. A.; Weng, J. F.
1
2010
Computing Steiner points and probability Steiner points in \(\ell _{1}\) and \(\ell _{2}\) metric spaces. Zbl 1194.05020
Weng, J. F.; Mareels, I.; Thomas, D. A.
1
2009
Optimum Steiner ratio for gradient-constrained networks connecting three points in 3-space. I. Zbl 1200.90033
Prendergast, K.; Thomas, D. A.; Weng, J. F.
1
2009
Identifying Steiner minimal trees on four points in space. Zbl 1221.05063
Weng, J. F.; Thomas, D. A.; Mareels, I.
1
2009
Gradient-constrained minimum networks. II: Labelled or locally minimal Steiner points. Zbl 1168.90626
Brazil, M.; Thomas, D. A.; Weng, J. F.
6
2008
Equivalence, indicators, quasi-indicators and optimal Steiner topologies on four points in space. Zbl 1154.90018
Weng, J. F.; MacGregor Smith, J.; Brazil, M.; Thomas, D. A.
1
2008
Canonical forms and algorithms for Steiner trees in uniform orientation metrics. Zbl 1095.68074
Brazil, M.; Thomas, D. A.; Weng, J. F.; Zachariasen, M.
9
2006
Locally minimal uniformly oriented shortest networks. Zbl 1275.90114
Brazil, Marcus; Thomas, Doreen A.; Weng, Jia Feng
5
2006
Minimum cost flow-dependent communication networks. Zbl 1103.90031
Thomas, D. A.; Weng, J. F.
4
2006
Approximations and lower bounds for the length of minimal Euclidean Steiner trees. Zbl 1133.90408
Rubinstein, J. H.; Weng, J.; Wormald, N.
3
2006
Cost optimisation for underground mining networks. Zbl 1093.90067
Brazil, Marcus; Thomas, Doreen A.; Weng, Jia F.; Rubinstein, J. Hyam; Lee, David H.
1
2005
Upper and lower bounds for the lengths of Steiner trees in 3-space. Zbl 1068.05014
Brazil, M.; Thomas, D. A.; Weng, J. F.
4
2004
Exactly solvable and unsolvable shortest network problems in 3D-space. Zbl 1062.05037
Booth, R. S.; Thomas, D. A.; Weng, J. F.
1
2004
Minimum networks for four points in space. Zbl 1009.05042
Rubinstein, J. H.; Thomas, D. A.; Weng, J.
9
2002
Forbidden subpaths for Steiner minimum networks in uniform orientation metrics. Zbl 1014.68119
Brazil, M.; Thomas, D. A.; Weng, J. F.
3
2002
Generalized Melzak’s construction in the Steiner tree problem. Zbl 1045.05032
Weng, Jia F.
1
2002
Gradient-constrained minimum networks. I: Fundamentals. Zbl 1068.90605
Brazil, M.; Rubinstein, J. H.; Thomas, D. A.; Weng, J. F.; Wormald, N. C.
13
2001
Steiner trees on curved surfaces. Zbl 0982.05036
Weng, J. F.
2
2001
Steiner minimal trees with one polygonal obstacle. Zbl 1054.90064
Weng, J. F.; MacGregor Smith, J.
1
2001
Minimum networks in uniform orientation metrics. Zbl 0973.05022
Brazil, M.; Thomas, D. A.; Weng, J. F.
9
2000
On the complexity of the Steiner problem. Zbl 1028.90045
Brazil, M.; Thomas, D. A.; Weng, J. F.
6
2000
Rectilinear Steiner minimal trees on parallel lines. Zbl 0944.05020
Brazil, Marcus; Thomas, Doreen A.; Weng, Jia Feng
1
2000
Steiner trees, coordinate systems and NP-hardness. Zbl 0981.68120
Weng, J. F.
1
2000
Pseudo-Gilbert-Steiner trees. Zbl 0923.05016
Trietsch, D.; Weng, J. F.
1
1999
Gradient-constrained minimal Steiner trees. Zbl 0915.05042
Brazil, M.; Thomas, D. A.; Weng, J. F.
3
1998
Shortest networks on spheres. Zbl 0915.05043
Brazil, M.; Rubinstein, J. H.; Thomas, D. A.; Weng, J. F.; Wormald, N. C.
1
1998
Minimal Steiner trees for rectangular arrays of lattice points. Zbl 0883.05038
Brazil, M.; Rubinstein, J. H.; Thomas, D. A.; Weng, J. F.; Wormald, N. C.
6
1997
Full minimal Steiner trees on lattice sets. Zbl 0874.05018
Brazil, M.; Rubinstein, J. H.; Thomas, D. A.; Weng, J. F.; Wormald, N. C.
4
1997
Compression theorems and Steiner ratios on spheres. Zbl 0895.90173
Rubinstein, J. H.; Weng, J. F.
4
1997
Shortest networks for smooth curves. Zbl 0884.05036
Weng, J. F.
3
1997
Expansion of linear Steiner trees. Zbl 0897.68077
Weng, J. F.
2
1997
Minimal Steiner trees for \(2^ k \times 2^ k\) square lattices. Zbl 0844.05036
Brazil, M.; Cole, T.; Rubinstein, J. H.; Thomas, D. A.; Weng, J. F.; Wormald, N. C.
5
1996
Steiner minimal trees on regular polygons with centre. Zbl 0826.05024
Weng, J. F.; Booth, R. S.
1
1995
Variational approach and Steiner minimal trees on four points. Zbl 0808.05037
Weng, J. F.
6
1994
Steiner polygons in the Steiner problem. Zbl 0808.51022
Weng, Jia Feng
2
1994
Determining shortest networks in the Euclidean plane. Zbl 0796.05027
Weng, J. F.
1
1994
An optimal group testing algorithm on \(k\) disjoint sets. Zbl 0773.90041
Weng, J. F.; Hwang, F. K.
1
1993
The shortest network under a given topology. Zbl 0764.68119
Hwang, F. K.; Weng, J. F.
11
1992
Steiner minimal trees for a class of zigzag lines. Zbl 0756.05042
Booth, R. S.; Weng, J. F.
6
1992
Degree-five Steiner points cannot reduce network costs for planar sets. Zbl 0774.05032
Rubinstein, J. H.; Thomas, D. A.; Weng, J. F.
5
1992
Degenerate Gilbert-Steiner trees. Zbl 0765.90039
Weng, J. F.
1
1992
Group testing with two and three defectives. Zbl 0800.62628
Chang, X. M.; Hwang, F. K.; Weng, J. F.
3
1989
Optimal detection of two defectives with a parity check device. Zbl 0643.90038
Chang, X. M.; Hwang, F. K.; Weng, J. F.
7
1988
Steiner minimal trees for regular polygons. Zbl 0607.05022
Du, D. Z.; Hwang, F. K.; Weng, J. F.
20
1987
Hexagonal coordinate systems and Steiner minimal trees. Zbl 0601.05016
Hwang, F. K.; Weng, J. F.
8
1986
Steiner minimal trees on zig-zag lines. Zbl 0523.51018
Du, Ding-Zhu; Hwang, F. K.; Weng, J. F.
17
1983
A class of full Steiner minimal trees. Zbl 0508.05029
Hwang, F. K.; Weng, Jia Feng; Du, Ding-Zhu
4
1983

Citations by Year