Exact and Approximation Algorithms for the Expanding Search Problem
From MaRDI portal
Publication:5084651
DOI10.1287/ijoc.2020.1047OpenAlexW3134639002MaRDI QIDQ5084651
Roel Leus, Ben Hermans, Jannik Matuschke
Publication date: 28 June 2022
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1911.08959
Related Items (2)
Network construction/restoration problems: cycles and complexity ⋮ Optimal patrolling strategies for trees and complete networks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimal search for moving targets
- The density maximization problem in graphs
- Emergency path restoration problems
- Finding a length-constrained maximum-sum or maximum-density subtree and its application to logistics
- A new formulation for the traveling deliveryman problem
- A branch-and-price algorithm for the minimum latency problem
- The expanding search ratio of a graph
- Approximating min sum set cover
- Approximate solutions for expanding search games on general networks
- Approximating a class of combinatorial problems with rational objective function
- Approximation Techniques for Average Completion Time Scheduling
- Maximal Flow Through a Network
- A Faster, Better Approximation Algorithm for the Minimum Latency Problem
- On Finding Dense Subgraphs
- The complexity of the travelling repairman problem
- A new approach to the maximum-flow problem
- Sequencing with Series-Parallel Precedence Constraints
- An algorithm for the single machine sequencing problem with precedence constraints
- Single-Machine Scheduling Polyhedra with Precedence Constraints
- Decomposition Algorithms for Single-Machine Sequencing with Precedence Relations and Deferral Costs
- The Delivery Man Problem and Cumulative Matroids
- Approximate Local Search in Combinatorial Optimization
- Technical Note—The Complexity of the Optimal Searcher Path Problem
- A General Approximation Technique for Constrained Forest Problems
- A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees
- Scheduling Tasks with AND/OR Precedence Constraints
- Search Theory
- On Submodular Search and Machine Scheduling
- Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems
- Solving Zero-Sum Games Using Best-Response Oracles with Applications to Search Games
- Lateness Minimization in Pairwise Connectivity Restoration Problems
- Multiple searchers searching for a randomly distributed immobile target on a unit network
- Mining Coal or Finding Terrorists: The Expanding Search Paradigm
- The Theory of Search. I. Kinematic Bases
- The Theory of Search. II. Target Detection
- The Theory of Search
- Single-Machine Scheduling with Precedence Constraints
- The Weighted Maximum-Mean Subtree and Other Bicriterion Subtree Problems
- Algorithms - ESA 2003
This page was built for publication: Exact and Approximation Algorithms for the Expanding Search Problem
