On the low-dimensional Steiner minimum tree problem in Hamming metric (Q393125): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Computing steiner minimum trees in Hamming metric / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4763418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner problem with edge lengths 1 and 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Thek-Steiner Ratio in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved LP-based approximation for steiner tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner ratio of several discrete metric spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the approximability of the Steiner tree problem in phylogeny / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner problem in phylogeny is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Aligning sequences via an evolutionary tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3874241 / rank
 
Normal rank

Revision as of 05:30, 7 July 2024

scientific article
Language Label Description Also known as
English
On the low-dimensional Steiner minimum tree problem in Hamming metric
scientific article

    Statements

    On the low-dimensional Steiner minimum tree problem in Hamming metric (English)
    0 references
    0 references
    0 references
    0 references
    16 January 2014
    0 references
    Steiner minimum tree
    0 references
    Hamming metric
    0 references
    Steiner ratio
    0 references
    approximation algorithm
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references