Improved approximation algorithms for the expanding search problem

DOI10.4230/LIPICS.ESA.2023.54MaRDI QIDQ6657009zbMATH OpenFDO

Authors Felix Hommelsheim, Max Klimm, Kevin Schewior

Publication date 6 January 2025

Full work available at URL https://doi.org/10.4230/LIPICS.ESA.2023.54

zbMATH Keywords

approximation algorithmexpanding searchgraph explorationsearch problemtraveling repairperson problem

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(3)

• Approximation algorithms for graph search problems with imperfect detection
• Bicriterial approximation for the incremental prize-collecting Steiner-tree problem
• Strategic hiding and exploration in networks

This page was built for publication: Improved approximation algorithms for the expanding search problem

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