New approximation algorithms for the heterogeneous weighted delivery problem

DOI10.1007/978-3-030-79527-6_10OpenAlexW3174360887MaRDI QIDQ5918637

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

Publication date: 22 March 2022

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-79527-6_10

zbMATH Keywords

approximation algorithmsenergy consumptionmessage deliverydelivery schedulesshortest-paths

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer system organization (68Mxx) Communication complexity, information complexity (68Q11)

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item

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