New approximation algorithms for the heterogeneous weighted delivery problem

DOI10.1016/j.tcs.2022.08.009OpenAlexW4292622033WikidataQ114129029 ScholiaQ114129029MaRDI QIDQ5918793

Stefano Leucci, Luciano Gualà, Davide Bilò, Guido Proietti, Mirko Rossi

Publication date: 16 September 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2022.08.009

zbMATH Keywords

approximation algorithmsenergy consumptionmessage deliverydelivery schedulesshortest-paths

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Exact and approximate algorithms for movement problems on (special classes of) graphs
• 3-approximation algorithm for a two depot, heterogeneous traveling salesman problem
• Energy-efficient fast delivery by mobile agents
• Polygon-constrained motion planning problems
• Data delivery by energy-constrained mobile agents
• An efficient algorithm for the fast delivery problem
• Collaborative delivery with energy-constrained mobile robots
• An approximation algorithm for a symmetric generalized multiple depot, multiple travelling salesman problem
• A 3/2-Approximation Algorithm for the Multiple TSP with a Fixed Number of Depots
• Minimizing movement
• Capacitated Vehicle Routing with Non-uniform Speeds
• O(1)-Approximations for Maximum Movement Problems
• Data Delivery by Energy-Constrained Mobile Agents on a Line

This page was built for publication: New approximation algorithms for the heterogeneous weighted delivery problem