The Steiner problem with edge lengths 1 and 2 (Q1123630): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an 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.1016/0020-0190(89)90039-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2070664846 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3689203 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner Minimal Trees / 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: Q3797192 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A faster approximation algorithm for the Steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3322143 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computation of nearly minimal Steiner trees in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case performance of Rayward-Smith's Steiner tree heuristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner problem in networks: A survey / rank
 
Normal rank

Latest revision as of 09:09, 20 June 2024

scientific article
Language Label Description Also known as
English
The Steiner problem with edge lengths 1 and 2
scientific article

    Statements

    The Steiner problem with edge lengths 1 and 2 (English)
    0 references
    0 references
    0 references
    1989
    0 references
    approximation algorithm
    0 references
    NP-complete
    0 references
    Steiner problem on networks
    0 references

    Identifiers