The parameterized complexity of local search for TSP, more refined (Q378245): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q17 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C27 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68R10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C38 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C59 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6225279 / rank
 
Normal rank
Property / zbMATH Keywords
 
NP-hard problem
Property / zbMATH Keywords: NP-hard problem / rank
 
Normal rank
Property / zbMATH Keywords
 
heuristics
Property / zbMATH Keywords: heuristics / rank
 
Normal rank
Property / zbMATH Keywords
 
problem kernel
Property / zbMATH Keywords: problem kernel / rank
 
Normal rank
Property / zbMATH Keywords
 
fixed-parameter tractability
Property / zbMATH Keywords: fixed-parameter tractability / rank
 
Normal rank
Property / zbMATH Keywords
 
W[1]-hardness
Property / zbMATH Keywords: W[1]-hardness / rank
 
Normal rank
Property / zbMATH Keywords
 
lower bounds based on ETH
Property / zbMATH Keywords: lower bounds based on ETH / rank
 
Normal rank

Revision as of 11:06, 29 June 2023

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

    Identifiers

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