Collective tree exploration via potential function method

DOI10.4230/LIPICS.ITCS.2024.35MaRDI QIDQ6906400zbMATH OpenFDO

Authors Laurent Massoulié

Publication date 4 November 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ITCS.2024.35

zbMATH Keywords

online algorithmscompetitive analysiscollective explorationevolving tree

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• scientific article; zbMATH DE number 437566 (Why is no real title available?)
• scientific article; zbMATH DE number 65695 (Why is no real title available?)
• A recursive approach to multi-robot exploration of trees
• An optimal on-line algorithm for metrical task system
• Collective tree exploration
• Competitive Algorithms for Layered Graph Traversal
• Fast collaborative graph exploration
• Inverse M-matrices and ultrametric matrices
• LATIN 2004: Theoretical Informatics
• Shortest paths without a map
• Shortest paths without a map, but with an entropic regularizer
• Traversing Layered Graphs Using the Work Function Algorithm
• Why Robots Need Maps

Cited in

(1)

• Shortest paths without a map, but with an entropic regularizer

This page was built for publication: Collective tree exploration via potential function method

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