The approximability of the weighted Hamiltonian path completion problem on a tree (Q2566021)

From MaRDI portal
scientific article
Language Label Description Also known as
English
The approximability of the weighted Hamiltonian path completion problem on a tree
scientific article

    Statements

    The approximability of the weighted Hamiltonian path completion problem on a tree (English)
    0 references
    0 references
    0 references
    0 references
    22 September 2005
    0 references
    Hamiltonian path completion problem
    0 references
    Trees
    0 references
    Strongly NP-hard
    0 references
    Approximation algorithm
    0 references
    Fully polynomial-time approximation scheme
    0 references

    Identifiers

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