Pages that link to "Item:Q1841242"
From MaRDI portal
The following pages link to Approximation algorithms for lawn mowing and milling (Q1841242):
Displayed 14 items.
- Watchman tours for polygons with holes (Q419503) (← links)
- Minimum covering with travel cost (Q454247) (← links)
- An information roadmap method for robotic sensor path planning (Q614694) (← links)
- Optimality and competitiveness of exploring polygons by mobile robots (Q617716) (← links)
- Not being (super)thin or solid is hard: A study of grid Hamiltonicity (Q924074) (← links)
- A framework for multi-robot node coverage in sensor networks (Q1022471) (← links)
- Polygon exploration with time-discrete vision (Q1037781) (← links)
- Capacitated arc routing problem with deadheading demands (Q1761173) (← links)
- Competitive on-line coverage of grid environments by a mobile robot (Q1869751) (← links)
- An Improved Strategy for Exploring a Grid Polygon (Q3408174) (← links)
- COMPETITIVE COMPLEXITY OF MOBILE ROBOT ON-LINE MOTION PLANNING PROBLEMS (Q3575385) (← links)
- AN APPROXIMATION ALGORITHM FOR LOCATING MAXIMAL DISKS WITHIN CONVEX POLYGONS (Q4650086) (← links)
- TERRAIN DECOMPOSITION AND LAYERED MANUFACTURING (Q4682152) (← links)
- The snowblower problem (Q5894212) (← links)