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} (Q3087623): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Gradient-constrained minimum networks. I: Fundamentals. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gradient-constrained minimum networks. II: Labelled or locally minimal Steiner points / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof of the Gilbert-Pollak conjecture on the Steiner ratio / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum Steiner ratio for gradient‐constrained networks connecting three points in 3‐space, part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variational approach to the Steiner network problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Steiner points for gradient-constrained minimum networks / rank
 
Normal rank

Latest revision as of 10:09, 4 July 2024

scientific article
Language Label Description Also known as
English
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}
scientific article

    Statements

    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} (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    16 August 2011
    0 references
    0 references
    minimum networks
    0 references
    gradient-constrained networks
    0 references
    Steiner trees
    0 references
    locally minimal
    0 references
    0 references
    0 references