Time versus cost tradeoffs for deterministic rendezvous in networks
From MaRDI portal
Publication:5964898
DOI10.1007/s00446-015-0253-8zbMath1352.68117arXiv1508.02471OpenAlexW2568630404MaRDI QIDQ5964898
Publication date: 1 March 2016
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1508.02471
Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14)
Related Items (6)
Memory optimal dispersion by anonymous mobile robots ⋮ Byzantine gathering in polynomial time ⋮ Unnamed Item ⋮ Memory optimal dispersion by anonymous mobile robots ⋮ Asynchronous approach in the plane: a deterministic polynomial algorithm ⋮ Deterministic rendezvous with different maps
Cites Work
- Unnamed Item
- Gathering of asynchronous robots with limited visibility
- Optimal graph exploration without good maps
- How to meet in anonymous network
- \((p-1)/(p+1)\)-approximate algorithms for \(p\)-traveling salesmen problems on a tree with minmax objective
- Operations research/management science at work.
- Piecemeal graph exploration by a mobile robot.
- The power of a pebble: Exploring and mapping directed graphs
- A heuristic with worst-case analysis for minimax routing of two travelling salesmen on a tree
- How to meet when you forget: log-space rendezvous in arbitrary graphs
- Fast collaborative graph exploration
- Asynchronous deterministic rendezvous in graphs
- Deterministic rendezvous in graphs
- Deterministic Rendezvous, Treasure Hunts, and Strongly Universal Exploration Sequences
- Delays Induce an Exponential Memory Gap for Rendezvous in Trees
- Optimal constrained graph exploration
- Distributed Computing by Mobile Robots: Gathering
- Tree exploration with logarithmic memory
- Randomized rendezvous with limited memory
- How to meet asynchronously (almost) everywhere
- Collective tree exploration
- Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids
- Undirected connectivity in log-space
- Two Dimensional Rendezvous Search
- Finding Your Kids When They Are Lost
- Rendezvous on the Line when the Players' Initial Distance is Given by an Unknown Probability Distribution
- Rendezvous search when marks are left at the starting points
- Rendezvous search on labeled networks
- Minimax Rendezvous on the Line
- Exploring an unknown graph
- The Rendezvous Search Problem
- Exploring Unknown Undirected Graphs
- Exploring Unknown Environments
- Deterministic Network Exploration by Anonymous Silent Agents with Local Traffic Reports
- How to meet asynchronously at polynomial cost
- Algorithms – ESA 2005
- The rendezvous problem on discrete locations
- LATIN 2004: Theoretical Informatics
This page was built for publication: Time versus cost tradeoffs for deterministic rendezvous in networks
