Pages that link to "Item:Q5901749"
From MaRDI portal
The following pages link to Traversing a set of points with a minimum number of turns (Q5901749):
Displayed 7 items.
- Improved parameterized algorithms for minimum link-length rectilinear spanning path problem (Q477189) (← links)
- On the approximability of covering points by lines and related problems (Q904111) (← links)
- Covering paths for planar point sets (Q2250054) (← links)
- Is It FPT to Cover Points with Tours on Minimum Number of Bends (Errata)? (Q2950590) (← links)
- FPT-ALGORITHMS FOR MINIMUM-BENDS TOURS (Q2999094) (← links)
- On Covering Points with Minimum Turns (Q5892218) (← links)
- Distributed transformations of Hamiltonian shapes based on line moves (Q5918588) (← links)