Collecting Information by Power-Aware Mobile Agents

DOI10.1007/978-3-642-33651-5_4zbMath1331.68150OpenAlexW1935259400MaRDI QIDQ4909401

Arnaud Labourel, Yann Vaxès, Jurek Czyzowicz, Andrzej Pelc, Julian Anaya, Jérémie Chalopin

Publication date: 13 March 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-33651-5_4

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Distributed algorithms (68W15)

Related Items (8)

Energy-Optimal Broadcast in a Tree with Mobile Agents ⋮ Rendezvous Problem ⋮ Unnamed Item ⋮ Gossiping by energy-constrained mobile agents in tree networks ⋮ Communication Problems for Mobile Agents Exchanging Energy ⋮ Asymptotic connectedness of random interval graphs in a one dimensional data delivery problem ⋮ Energy-optimal broadcast and exploration in a tree using mobile agents ⋮ The pony express communication problem

This page was built for publication: Collecting Information by Power-Aware Mobile Agents