Euclidean Steiner minimal trees, minimum energy configurations, and the embedding problem of weighted graphs in \(E^ 3\) (Q5961625): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: FindSteinerTree / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Euclidean minimum spanning trees and bichromatic closest pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lower Bound for the Steiner Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner Trees for Ladders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3675065 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal length tree networks on the unit sphere / 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: Steiner Minimal Trees on Zig-Zag Lines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disproofs of generalized Gilbert-Pollak conjecture on the Steiner ratio in three or more dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Computing Steiner Minimal Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner Minimal Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to find Steiner minimal trees in Euclidean \(d\)-space / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(n logn) heuristic for steiner minimal tree problems on the euclidean metric / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Steiner ratio in 3-space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner problem in networks: A survey / rank
 
Normal rank

Latest revision as of 10:51, 27 May 2024

scientific article; zbMATH DE number 981922
Language Label Description Also known as
English
Euclidean Steiner minimal trees, minimum energy configurations, and the embedding problem of weighted graphs in \(E^ 3\)
scientific article; zbMATH DE number 981922

    Statements

    Euclidean Steiner minimal trees, minimum energy configurations, and the embedding problem of weighted graphs in \(E^ 3\) (English)
    0 references
    0 references
    0 references
    21 April 1997
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Steiner trees
    0 references
    Euclidean Graph embedding problem
    0 references
    minimum energy configurations
    0 references