Pages that link to "Item:Q378245"
From MaRDI portal
The following pages link to The parameterized complexity of local search for TSP, more refined (Q378245):
Displaying 9 items.
- On the parameterized complexity of consensus clustering (Q2015135) (← links)
- Parameterized dynamic cluster editing (Q2223691) (← links)
- Searching for better fill-in (Q2453556) (← links)
- Can local optimality be used for efficient data reduction? (Q2692734) (← links)
- Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP (Q5075760) (← links)
- Parameterized Dynamic Cluster Editing (Q5090987) (← links)
- Improving TSP Tours Using Dynamic Programming over Tree Decompositions. (Q5111717) (← links)
- Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions) (Q5221061) (← links)
- Methods for determining cycles of a specific length in undirected graphs with edge weights (Q6181338) (← links)