Pages that link to "Item:Q924881"

The following pages link to Searching the \(k\)-change neighborhood for TSP is W[1]-hard (Q924881):

Displaying 15 items.

• The parameterized complexity of local search for TSP, more refined (Q378245) (← links)
• Incremental list coloring of graphs, parameterized by conservation (Q391091) (← links)
• Local search: is brute-force avoidable? (Q439931) (← links)
• Stable assignment with couples: parameterized complexity and local search (Q456691) (← links)
• The parameterized complexity of \(k\)-flip local search for SAT and MAX SAT (Q456705) (← links)
• Parameterized approximation of dominating set problems (Q975529) (← links)
• Improved integrality gap upper bounds for traveling salesperson problems with distances one and two (Q1754106) (← links)
• Parameterized complexity and local search approaches for the stable marriage problem with ties (Q1959726) (← links)
• On the parameterized complexity of consensus clustering (Q2015135) (← links)
• Local search for string problems: brute-force is essentially optimal (Q2437744) (← links)
• Searching for better fill-in (Q2453556) (← links)
• Can local optimality be used for efficient data reduction? (Q2692734) (← links)
• The Parameterized Complexity of k-Flip Local Search for SAT and MAX SAT (Q3637173) (← links)
• Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP (Q5075760) (← links)
• Improving TSP Tours Using Dynamic Programming over Tree Decompositions. (Q5111717) (← links)