Complexity of min-max subsequence problems (Q1014423)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Complexity of min-max subsequence problems
scientific article

    Statements

    Complexity of min-max subsequence problems (English)
    0 references
    0 references
    0 references
    28 April 2009
    0 references
    computational complexity
    0 references
    polynomial-time approximation scheme
    0 references
    min-max subsequence problem
    0 references

    Identifiers