Pages that link to "Item:Q4818599"
From MaRDI portal
The following pages link to COVERING A SET OF POINTS WITH A MINIMUM NUMBER OF TURNS (Q4818599):
Displaying 8 items.
- Improved parameterized algorithms for minimum link-length rectilinear spanning path problem (Q477189) (← links)
- Generating and counting valid patterns in routes between two points (Q1080436) (← 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)
- Traversing a set of points with a minimum number of turns (Q5901403) (← links)
- Traversing a set of points with a minimum number of turns (Q5901749) (← links)