A probably fast, provably optimal algorithm for rectilinear Steiner trees (Q4312746): 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 / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/rsa.3240050405 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2037448683 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rectilinear steiner trees: Efficient special-case algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An SST-based algorithm for the steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two probabilistic results on rectilinear Steiner trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The largest minimal rectilinear steiner trees for a set of <i>n</i> points enclosed in a rectangle with given perimeter / rank
 
Normal rank
Property / cites work
 
Property / cites work: The steiner problem in graphs / 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: A guided tour of Chernoff bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Steiner’s Problem with Rectilinear Distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Steiner Minimal Trees with Rectilinear Distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(n log n) algorithm for suboptimal rectilinear Steiner trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4057549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic partitioning algorithms for the rectilinear steiner problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Use of Steiner's problem in suboptimal routing in rectilinear metric / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5654074 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast heuristic algorithms for rectilinear Steiner trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3922181 / rank
 
Normal rank

Latest revision as of 09:20, 23 May 2024

scientific article; zbMATH DE number 683637
Language Label Description Also known as
English
A probably fast, provably optimal algorithm for rectilinear Steiner trees
scientific article; zbMATH DE number 683637

    Statements

    A probably fast, provably optimal algorithm for rectilinear Steiner trees (English)
    0 references
    0 references
    0 references
    0 references
    8 November 1994
    0 references
    rectilinear Steiner minimal tree
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references