Cut and patch Steiner trees for ladders (Q1356409): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / reviewed by
 
Property / reviewed by: Ding-Zhu Du / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Ding-Zhu Du / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner Trees on a Checkerboard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner Trees for Ladders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner minimal trees for bar waves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner Minimal Tree for Points on a Circle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner minimal trees on sets of four points / 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: Steiner minimal trees for regular polygons / 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: A primer of the Euclidean Steiner problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner Minimal Trees on Chinese Checkerboards / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner tree problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Problem of Steiner / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:08, 27 May 2024

scientific article
Language Label Description Also known as
English
Cut and patch Steiner trees for ladders
scientific article

    Statements

    Cut and patch Steiner trees for ladders (English)
    0 references
    0 references
    0 references
    0 references
    9 June 1997
    0 references
    The authors show how to construct the Steiner minimum tree for a ladder by the cut and patch method. They prove that all intersection points between the Steiner tree and the ladder lie on two straight lines.
    0 references
    0 references
    ladder
    0 references
    Steiner tree
    0 references
    0 references