Embedding rectilinear Steiner trees with length restrictions (Q344768): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: The repeater tree construction problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5684698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Rectilinear Steiner Tree Problem is $NP$-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945794 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the weight of shallow Steiner trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Rectilinear Steiner Tree Problem with Given Topology and Length Restrictions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The rectilinear Steiner arborescence problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Rectilinear Steiner Arborescence Problem Is NP-Complete / rank
 
Normal rank

Revision as of 23:32, 12 July 2024

scientific article
Language Label Description Also known as
English
Embedding rectilinear Steiner trees with length restrictions
scientific article

    Statements

    Embedding rectilinear Steiner trees with length restrictions (English)
    0 references
    0 references
    24 November 2016
    0 references
    Steiner trees with given topology
    0 references
    rectilinear Steiner trees
    0 references
    dynamic programming
    0 references
    totally unimodular
    0 references
    shallow light Steiner trees
    0 references

    Identifiers