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

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00453-012-9685-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2113885662 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: New classes of efficiently solvable generalized traveling salesman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A partial k-arboretum of graphs with bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization: New Upper and Lower Bound Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: On problems without polynomial kernels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight lower bounds for certain parameterized NP-hard problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case analysis of a new heuristic for the travelling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A study of exponential neighborhoods for the travelling salesman problem and for the quadratic assignment problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4503944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards Fully Multivariate Algorithmics: Some New Results and Directions in Parameter Ecology / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the parameterized complexity of multiple-interval graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local search: is brute-force avoidable? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3393448 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Planar Hamiltonian Circuit Problem is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling salesman problem and its variations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4461908 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incremental List Coloring of Graphs, Parameterized by Conservation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Programming Approach to Sequencing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which problems have strongly exponential complexity? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4365133 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4461911 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hardness of losing weight / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5187226 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4904144 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization – Preprocessing with a Guarantee / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching the \(k\)-change neighborhood for TSP is W[1]-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable assignment with couples: parameterized complexity and local search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reflections on Multivariate Algorithmics and Problem Parameterization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. V. Excluding a planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. X: Obstructions to tree-decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: The parameterized complexity of \(k\)-flip local search for SAT and MAX SAT / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 00:39, 7 July 2024

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