Speeding up the Dreyfus-Wagner algorithm for minimum Steiner trees (Q2466792): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On exact solutions for the rectilinear Steiner tree problem. I: Theoretical results / 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: Q4448761 / 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: Q4945796 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A catalog of Hanan grid problems / rank
 
Normal rank

Latest revision as of 15:22, 27 June 2024

scientific article
Language Label Description Also known as
English
Speeding up the Dreyfus-Wagner algorithm for minimum Steiner trees
scientific article

    Statements

    Speeding up the Dreyfus-Wagner algorithm for minimum Steiner trees (English)
    0 references
    0 references
    0 references
    0 references
    16 January 2008
    0 references
    0 references
    Steiner tree
    0 references
    Exact algorithm
    0 references
    Dynamic programming
    0 references
    0 references