Optimum steiner ratio for gradient-constrained networks connecting three points in 3-space, part II: The gradient-constraint m satisfies \documentclass{article} \usepackage{amsmath,amsfonts,amssymb}\pagestyle{empty}\begin{document}$ 1 \leq m \leq \sqrt{3}

Networks ◽  
2010 ◽  
Vol 57 (4) ◽  
pp. 354-361
Author(s):  
Doreen Thomas ◽  
Kevin Prendergast ◽  
Jia Weng
Keyword(s):  
Steiner Ratio ◽  
Gradient Constraint

scholarly journals The steiner ratio conjecture is true for five points

1985 ◽  
Vol 38 (2) ◽  
pp. 230-240 ◽  
Author(s):  
D.Z Du ◽  
F.K Hwang ◽  
E.Y Yao
Keyword(s):  
Steiner Ratio

Gradient-constraint Super-resolution Reconstruction Method Serving for Infrared Target Detection

2021 ◽  
pp. 1-1
Author(s):  
Tao Sun ◽  
Zhengqiang Xiong ◽  
Zhengxing Wang ◽  
Jie Yin ◽  
Yuhao Wu
Keyword(s):  
Target Detection ◽  
Super Resolution ◽  
Reconstruction Method ◽  
Gradient Constraint

scholarly journals A regularized magnetotelluric inversion with a minimum support gradient constraint

2020 ◽  
Vol 33 (3) ◽  
pp. 130-140
Author(s):  
Junjun Zhou ◽  
◽  
Xiangyun Hu ◽  
Tiaojie Xiao ◽  
Keyword(s):  
Minimum Support ◽  
Gradient Constraint ◽  
Magnetotelluric Inversion

scholarly journals Branched coverings and Steiner ratio

2015 ◽  
Vol 23 (5) ◽  
pp. 875-882
Author(s):  
A. O. Ivanov ◽  
A. A. Tuzhilin
Keyword(s):  
Steiner Ratio ◽  
Branched Coverings

ON THE STEINER RATIO IN $\mathcal{R}_{n}$

2011 ◽  
Vol 03 (04) ◽  
pp. 473-489
Author(s):  
HAI DU ◽  
WEILI WU ◽  
ZAIXIN LU ◽  
YINFENG XU
Keyword(s):  
Euclidean Space ◽  
Spanning Tree ◽  
Minimum Spanning Tree ◽  
Dimensional Euclidean Space ◽  
Minimum Length ◽  
Steiner Ratio ◽  
Line Segments ◽  
Finite Set ◽  
Steiner Minimum Tree ◽  
Set Of Points

The Steiner minimum tree and the minimum spanning tree are two important problems in combinatorial optimization. Let P denote a finite set of points, called terminals, in the Euclidean space. A Steiner minimum tree of P, denoted by SMT(P), is a network with minimum length to interconnect all terminals, and a minimum spanning tree of P, denoted by MST(P), is also a minimum network interconnecting all the points in P, however, subject to the constraint that all the line segments in it have to terminate at terminals. Therefore, SMT(P) may contain points not in P, but MST(P) cannot contain such kind of points. Let [Formula: see text] denote the n-dimensional Euclidean space. The Steiner ratio in [Formula: see text] is defined to be [Formula: see text], where Ls(P) and Lm(P), respectively, denote lengths of a Steiner minimum tree and a minimum spanning tree of P. The best previously known lower bound for [Formula: see text] in the literature is 0.615. In this paper, we show that [Formula: see text] for any n ≥ 2.

scholarly journals Steiner ratio for hyperbolic surfaces

2006 ◽  
Vol 82 (6) ◽  
pp. 77-79 ◽  
Author(s):  
Nobuhiro Innami ◽  
Byung Hak Kim
Keyword(s):  
Hyperbolic Surfaces ◽  
Steiner Ratio

scholarly journals The Steiner ratio for the dual normed plane

1997 ◽  
Vol 171 (1-3) ◽  
pp. 261-275 ◽  
Author(s):  
Peng-Jun Wan ◽  
Ding-Zhu Du ◽  
Ronald L. Graham
Keyword(s):  
Normed Plane ◽  
Steiner Ratio
Sign in / Sign up

Export Citation Format

Share Document