Probabilistic analysis of an enhanced partitioning algorithm for the steiner tree problem in <i>R<sup>d</sup></i> (Q4291488): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5835066 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5565773 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Problem of Steiner / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5556830 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convexity and the Steiner tree problem / rank
 
Normal rank

Latest revision as of 15:43, 22 May 2024

scientific article; zbMATH DE number 566355
Language Label Description Also known as
English
Probabilistic analysis of an enhanced partitioning algorithm for the steiner tree problem in <i>R<sup>d</sup></i>
scientific article; zbMATH DE number 566355

    Statements

    Probabilistic analysis of an enhanced partitioning algorithm for the steiner tree problem in <i>R<sup>d</sup></i> (English)
    0 references
    0 references
    0 references
    0 references
    10 May 1994
    0 references
    geometric Steiner minimum tree
    0 references
    multilayer VLSI routing
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers