Pages that link to "Item:Q439931"
From MaRDI portal
The following pages link to Local search: is brute-force avoidable? (Q439931):
Displaying 18 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)
- The parameterized complexity of \(k\)-flip local search for SAT and MAX SAT (Q456705) (← links)
- Minimizing Rosenthal potential in multicast games (Q493648) (← links)
- On the parameterized complexity of reconfiguration problems (Q527426) (← links)
- Local search with edge weighting and configuration checking heuristics for minimum vertex cover (Q646517) (← links)
- On the parameterized complexity of consensus clustering (Q2015135) (← links)
- Parameterized dynamic cluster editing (Q2223691) (← links)
- Data-driven inverse modelling through neural network (deep learning) and computational heat transfer (Q2236161) (← links)
- Introduction to reconfiguration (Q2331456) (← links)
- On the complexity of restoring corrupted colorings (Q2424718) (← links)
- Searching for better fill-in (Q2453556) (← links)
- Can local optimality be used for efficient data reduction? (Q2692734) (← links)
- Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics (Q2827798) (← links)
- Linear-Time Computation of a Linear Problem Kernel for Dominating Set on Planar Graphs (Q2891348) (← links)
- Vertex Cover Reconfiguration and Beyond (Q2942651) (← links)
- Parameterized Dynamic Cluster Editing (Q5090987) (← links)
