Two-agent tree evacuation

DOI10.1007/978-3-030-79527-6_12MaRDI QIDQ2117727zbMATH OpenOpenAlexFDO

Authors Henri Devillez, Béni Egressy, Robin Fritsch, Roger Wattenhofer

Publication date 22 March 2022

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

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3590298 (Why is no real title available?)
• Bamboo garden trimming problem (perpetual maintenance of machines with different attendance urgency factors)
• Collaboration without communication: evacuating two robots from a disk
• Collaborative search on the plane without communication
• Deterministic rendezvous in graphs
• Distributed Evacuation in Graphs with Multiple Exits
• Evacuating two robots from a disk: a second cut
• Gathering few fat mobile robots in the plane
• Graph exploration by a finite automaton
• How many ants does it take to find the food?
• Lower bounds for the capture time: linear, quadratic, and beyond
• Memory lower bounds for randomized collaborative search and implications for biology
• Minimax Solutions for Linear Search Problems
• On the linear search problem
• On-line parallel heuristics, processor scheduling and robot searching under the competitive framework
• Online graph exploration: New results on old and new algorithms
• Patrolling a path connecting a set of points with unbalanced frequencies of visits
• Reducibility among combinatorial problems
• Rendezvous of distance-aware mobile agents in unknown graphs
• The Rendezvous Search Problem
• Vertex-to-vertex pursuit in a graph
• Wireless evacuation on \(m\) rays with \(k\) searchers

Cited in

(1)

• Search and rescue on the line

This page was built for publication: Two-agent tree evacuation

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