Parameterized algorithms for the drone delivery problem

DOI10.4230/LIPICS.ISAAC.2025.8MaRDI QIDQ7364345zbMATH OpenFDO

Authors Simon Bartlmae, Andreas Hene, Joshua Könen, Heiko Röglin

Publication date 1 October 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ISAAC.2025.8

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• A linear time algorithm for finding tree-decompositions of small treewidth
• Algorithmic Aspects of Vertex Elimination on Graphs
• Algorithms for Scheduling Independent Tasks
• Algorithms for the collaborative delivery problem with monitored constraints
• Collective fast delivery by energy-efficient agents
• Complexity of Finding Embeddings in a k-Tree
• Complexity Results for Multiprocessor Scheduling under Resource Constraints
• Graph minors. II. Algorithmic aspects of tree-width
• Multigraph realizations of degree sequences: Maximization is easy, minimization is hard
• On the fast delivery problem with one or two packages
• On the hardness of the drone delivery problem
• Package delivery using drones with restricted movement areas
• Parameterized algorithms
• Representation of a finite graph by a set of intervals on the real line
• The subinterval cover problem

This page was built for publication: Parameterized algorithms for the drone delivery problem

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