The following pages link to (Q2768284):
Displaying 5 items.
- Approximation algorithms for lawn mowing and milling (Q1841242) (← links)
- Taming the knight's tour: minimizing turns and crossings (Q2067620) (← links)
- Reconfiguring simple \(s\), \(t\) Hamiltonian paths in rectangular grid graphs (Q2115888) (← links)
- Online searching with turn cost (Q2503358) (← links)
- Minimum Scan Cover with Angular Transition Costs (Q4997133) (← links)
