Approximation algorithms for the single robot line coverage problem
DOI10.1007/978-3-030-66723-8_32zbMATH Open1469.68119OpenAlexW3127516222MaRDI QIDQ3382005FDOQ3382005
Publication date: 20 September 2021
Published in: Algorithmic Foundations of Robotics XIV (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-66723-8_32
Recommendations
- scientific article; zbMATH DE number 1305467
- Approximation algorithms for some min-max postmen cover problems
- Approximation algorithms for some minimum postmen cover problems
- Approximation algorithms for some minimum postmen cover problems
- Approximation algorithms for TSP with neighborhoods in the plane
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Artificial intelligence for robotics (68T40)
Cites Work
- A Faster Strongly Polynomial Minimum Cost Flow Algorithm
- Title not available (Why is that?)
- Matching, Euler tours and the Chinese postman
- Approximation Algorithms for Some Postman Problems
- Arc Routing
- Coverage for robotics -- a survey of recent results
- On the windy postman problem on Eulerian graphs
- An improved approximation algorithm for ATSP
- Coordinated road-network search route planning by a team of UAVs
- A constant-factor approximation algorithm for the asymmetric traveling salesman problem
- Title not available (Why is that?)
- A parameterized approximation algorithm for the mixed and windy Capacitated Arc Routing Problem: theory and experiments
Cited In (3)
This page was built for publication: Approximation algorithms for the single robot line coverage problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3382005)
