Pages that link to "Item:Q2768284"
From MaRDI portal
The following pages link to Optimal covering tours with turn costs (Q2768284):
Displaying 9 items.
- Minimum covering with travel cost (Q454247) (← links)
- 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)
- Covering tours and cycle covers with turn costs: hardness and approximation (Q2294052) (← links)
- Online searching with turn cost (Q2503358) (← links)
- Approximating the Minimum Tour Cover with a Compact Linear Program (Q3192959) (← links)
- Minimum Scan Cover with Angular Transition Costs (Q4997133) (← links)
- What goes around comes around: covering tours and cycle covers with turn costs (Q6635695) (← links)