The parameterized complexity of local search for TSP, more refined (Q378245)

From MaRDI portal
scientific article
Language Label Description Also known as
English
The parameterized complexity of local search for TSP, more refined
scientific article

    Statements

    The parameterized complexity of local search for TSP, more refined (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    11 November 2013
    0 references
    NP-hard problem
    0 references
    heuristics
    0 references
    problem kernel
    0 references
    fixed-parameter tractability
    0 references
    W[1]-hardness
    0 references
    lower bounds based on ETH
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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