Searching a fixed graph
From MaRDI portal
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)
Recommendations
Cited in
(40)- A new formulation for the traveling deliveryman problem
- Approximation and complexity of multi-target graph search and the Canadian traveler problem
- A meta-heuristic based goal-selection strategy for mobile robot search in an unknown environment
- A general framework for searching on a line
- On the approximation ratio of the random Chinese postman tour for network search
- The expanding search ratio of a graph
- Searching for multiple objects in multiple locations
- Minimizing the average searching time for an object within a graph
- The Chinese deliveryman problem
- Weighted group search on a line \& implications to the priority evacuation problem
- Graph exploration by energy-sharing mobile agents
- Further connections between contract-scheduling and ray-searching problems
- Online routing and searching on graphs with blocked edges
- Competitive search in a network
- Treasure evacuation with one robot on a disk
- Multi-target ray searching problems
- Searching on a line: a complete characterization of the optimal solution
- Polynomial time algorithms for some minimum latency problems
- Graph Searching in a Crime Wave
- Competitive Online Approximation of the Optimal Search Ratio
- scientific article; zbMATH DE number 4049076 (Why is no real title available?)
- Complexity of decision-theoretic troubleshooting
- The \(k\)-server problem
- The expanding search ratio of a graph
- Exact and Approximation Algorithms for the Expanding Search Problem
- scientific article; zbMATH DE number 7559116 (Why is no real title available?)
- Recontamination does not help to search a graph
- Polynomial Time Approximation Schemes for the Traveling Repairman and Other Minimum Latency Problems
- Lower bounds in on-line geometric searching
- The ultimate strategy to search on \(m\) rays?
- Best-of-both-worlds analysis of online search
- Multirobot search for a stationary object placed in a known environment with a combination of GRASP and VND
- Algorithms for \(p\)-Faulty Search on a half-line
- Online search with a hint
- Evacuation of equilateral triangles by mobile agents of limited communication range
- Query strategies for priced information
- Complexity of fixed order routing
- Online search with a hint
- On the approximation of shortest escape paths
- Exact algorithms for the minimum latency problem
This page was built for publication: Searching a fixed graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4818841)