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

From MaRDI portal
Revision as of 00:39, 7 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The parameterized complexity of local search for TSP, more refined
scientific article

    Statements

    title
    The parameterized complexity of local search for TSP, more refined (English)
    0 references
    author
    Jiong Guo
    0 references
    Sepp Hartung
    0 references
    Rolf Niedermeier
    0 references
    Ondřej Suchý
    0 references
    published in
    Algorithmica
    0 references
    publication date
    11 November 2013
    0 references
    zbMATH Keywords
    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
    cites work
    Q4503944
    0 references
    Q3393448
    0 references
    Q4461908
    0 references
    Q4365133
    0 references
    Q4461911
    0 references
    Q5187226
    0 references
    Q4904144
    0 references
    Q3002818
    0 references
    Q5710169
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q17
    0 references
    90C27
    0 references
    68R10
    0 references
    05C38
    0 references
    90C59
    0 references
    zbMATH DE Number
    6225279
    0 references
    OpenAlex ID
    W2113885662
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q378245&oldid=35359873"
    Powered by MediaWiki