Approximation algorithms for graph search problems with imperfect detection

DOI10.1007/978-3-032-06706-7_15MaRDI QIDQ6860259zbMATH OpenFDO

Authors Martijn van Ee, René A. Sitters

Publication date 10 February 2026

Full work available at URL https://doi.org/10.1007/978-3-032-06706-7_15

zbMATH Keywords

approximation algorithmsgraph searchimperfect detection

Mathematics Subject Classification ID

Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27)

Cites work

• A (slightly) improved approximation algorithm for metric TSP
• A 1.5-approximation for path TSP
• An improved approximation ratio for the minimum latency problem
• Discrete Sequential Search with Positive Switch Cost
• Exact and Approximation Algorithms for the Expanding Search Problem
• scientific article; zbMATH DE number 4209901 (Why is no real title available?)
• scientific article; zbMATH DE number 2086925 (Why is no real title available?)
• Improved algorithms for orienteering and related problems
• Improved approximation algorithms for the expanding search problem
• Mining coal or finding terrorists: the expanding search paradigm
• P-Complete Approximation Problems
• Polynomial Time Approximation Schemes for the Traveling Repairman and Other Minimum Latency Problems
• Reducing path TSP to TSP
• The minimum latency problem
• The Theory of Search. I. Kinematic Bases
• The theory of search. II. Target detection
• The theory of search: III. The optimum distribution of searching effort
• Time-critical testing and search problems

This page was built for publication: Approximation algorithms for graph search problems with imperfect detection

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