Collective graph exploration parameterized by vertex cover

DOI10.4230/LIPICS.IPEC.2023.22MaRDI QIDQ6926187zbMATH OpenFDO

Authors Siddharth Gupta, Guy Sa'Ar, Meirav Zehavi

Publication date 24 September 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.IPEC.2023.22

zbMATH Keywords

approximation algorithmparameterized complexityvertex covertreedepthcollective graph exploration

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68Wxx) Parameterized complexity, tractability and kernelization (68Q27)

Cites work

• scientific article; zbMATH DE number 1179517 (Why is no real title available?)
• A faster 2-approximation algorithm for the minmax p-traveling salesmen problem on a tree
• A general lower bound for collaborative tree exploration
• A heuristic with worst-case analysis for minimax routing of two travelling salesmen on a tree
• A recursive approach to multi-robot exploration of trees
• An application of simultaneous diophantine approximation in combinatorial optimization
• Bin packing with fixed number of bins revisited
• Collaborative exploration of trees by energy-constrained mobile robots
• Collective graph exploration parameterized by vertex cover
• Collective tree exploration
• Fast collaborative graph exploration
• Integer Programming with a Fixed Number of Variables
• Minkowski's Convex Body Theorem and Integer Programming
• Online graph exploration algorithms for cycles and trees by multiple searchers
• Smart Robot Teams Exploring Sparse Trees
• \((p-1)/(p+1)\)-approximate algorithms for \(p\)-traveling salesmen problems on a tree with minmax objective

Cited in

(1)

• Collective graph exploration parameterized by vertex cover

This page was built for publication: Collective graph exploration parameterized by vertex cover

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