scientific article; zbMATH DE number 7378373
From MaRDI portal
Publication:5005158
DOI10.4230/LIPIcs.MFCS.2018.56zbMath1497.68058arXiv1809.00077MaRDI QIDQ5005158
Daniel Graf, Andreas Bärtschi, Matúš Mihalák
Publication date: 4 August 2021
Full work available at URL: https://arxiv.org/abs/1809.00077
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (5)
On the fast delivery problem with one or two packages ⋮ Collaborative delivery on a fixed path with homogeneous energy-constrained agents ⋮ New approximation algorithms for the heterogeneous weighted delivery problem ⋮ New approximation algorithms for the heterogeneous weighted delivery problem ⋮ Asymptotic connectedness of random interval graphs in a one dimensional data delivery problem
Uses Software
Cites Work
- Convergecast and broadcast by power-aware mobile agents
- Energy-efficient fast delivery by mobile agents
- Data delivery by energy-constrained mobile agents
- Collaborative delivery with energy-constrained mobile robots
- Linear Search by a Pair of Distinct-Speed Robots
- Communication Problems for Mobile Agents Exchanging Energy
- Distributed Patrolling with Two-Speed Robots (and an Application to Transportation)
- Boundary Patrolling by Mobile Agents with Distinct Maximal Speeds
- Planar Formulae and Their Uses
- Matching, Euler tours and the Chinese postman
- Data Delivery by Energy-Constrained Mobile Agents on a Line
- The Beachcombers’ Problem: Walking and Searching with Mobile Robots
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication:
