Steiner tree problem with minimum number of Steiner points and bounded edge-length (Q294609): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
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 Complexity of Computing Steiner Minimal Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner Minimal Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bottleneck Steiner trees in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Minimum Cost Networks with Nonlinear Costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4869540 / rank
 
Normal rank

Latest revision as of 03:48, 12 July 2024

scientific article
Language Label Description Also known as
English
Steiner tree problem with minimum number of Steiner points and bounded edge-length
scientific article

    Statements

    Steiner tree problem with minimum number of Steiner points and bounded edge-length (English)
    0 references
    0 references
    0 references
    16 June 2016
    0 references
    approximation algorithms
    0 references
    Steiner minimum trees
    0 references
    VLSI design
    0 references
    WDM optimal networks
    0 references
    wireless communications
    0 references

    Identifiers