Makespan trade-offs for visiting triangle edges (extended abstract)

DOI10.1007/978-3-030-79987-8_24OpenAlexW3174121708MaRDI QIDQ2115869FDOQ2115869

Authors: Konstantinos Georgiou, Somnath Kundu, Paweł Prałat 

Publication date: 22 March 2022

Full work available at URL: https://arxiv.org/abs/2105.01191

Recommendations

• Exploring and triangulating a region by a swarm of robots
• Online exploration and triangulation in orthogonal polygonal regions
• Evacuating equilateral triangles and squares in the face-to-face model
• Evacuating an equilateral triangle in the face-to-face model

zbMATH Keywords

trianglevehicle routingtrade-offs2-dimensional search and navigationmake-span

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• The vehicle routing problem: An overview of exact and approximate algorithms
• The truck dispatching problem
• The vehicle routing problem
• Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
• A quasipolynomial time approximation scheme for Euclidean capacitated vehicle routing
• Parallel searching in the plane
• Structural information and communication complexity. 27th international colloquium, SIROCCO 2020, Paderborn, Germany, June 29 -- July 1, 2020. Proceedings
• The traveling salesman problem for lines, balls, and planes

Uses Software

• VRP

This page was built for publication: Makespan trade-offs for visiting triangle edges (extended abstract)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2115869)