Exact and Approximation Algorithms for the Expanding Search Problem
Pages 281 - 296
Abstract
Suppose a target is hidden in one of the vertices of an edge-weighted graph according to a known probability distribution. Starting from a fixed root node, an expanding search visits the vertices sequentially until it finds the target, where the next vertex can be reached from any of the previously visited vertices. That is, the time to reach the next vertex equals the shortest-path distance from the set of all previously visited vertices. The expanding search problem then asks for a sequence of the nodes, so as to minimize the expected time to finding the target. This problem has numerous applications, such as searching for hidden explosives, mining coal, and disaster relief. In this paper, we develop exact algorithms and heuristics, including a branch-and-cut procedure, a greedy algorithm with a constant-factor approximation guarantee, and a local search procedure based on a spanning-tree neighborhood. Computational experiments show that our branch-and-cut procedure outperforms existing methods for instances with nonuniform probability distributions and that both our heuristics compute near-optimal solutions with little computational effort.
Summary of Contribution: This paper studies new algorithms for the expanding search problem, which asks to search a graph for a target hidden in one of the nodes according to a known probability distribution. This problem has applications such as searching for hidden explosives, mining coal, and disaster relief. We propose several new algorithms, including a branch-and-cut procedure, a greedy algorithm, and a local search procedure; and we analyze their performance both experimentally and theoretically. Our analysis shows that the algorithms improve on the performance of existing methods and establishes the first constant-factor approximation guarantee for this problem.
References
[1]
Afrati F, Cosmadakis S, Papadimitriou CH, Papageorgiou G, Papakostantinou N (1986) The complexity of the travelling repairman problem. RAIRO Theor. Inform. Appl. 20(1):79–87.
[2]
Alpern S, Gal S (2003) The Theory of Search Games and Rendezvous (Kluwer, Dordrecht, Netherlands).
[3]
Alpern S, Lidbetter T (2013) Mining coal or finding terrorists: The expanding search paradigm. Oper. Res. 61(2):265–279.
[4]
Alpern S, Lidbetter T (2019) Approximate solutions for expanding search games on general networks. Ann. Oper. Res. 275(2):259–279.
[5]
Alpern S, Fokkink R, Gasieniec L, Lindelauf R, Subrahmanian V, eds. (2013) Search Theory: A Game Theoretic Perspective (Springer, New York).
[6]
Angelopoulos S, Dürr C, Lidbetter T (2019) The expanding search ratio of a graph. Discrete Appl. Math. 260:51–65.
[7]
Archer A, Levin A, Williamson DP (2008) A faster, better approximation algorithm for the minimum latency problem. SIAM J. Comput. 37(5):1472–1498.
[8]
Ausiello G, Leonardi S, Marchetti-Spaccamela A (2000) On salesmen, repairmen, spiders, and other traveling agents. Bongiovanni G, Petreschi R, Gambosi G, eds. Italian Conf. Algorithms Complexity, Lecture Notes in Computer Science, vol. 1767 (Springer, Berlin), 1–16.
[9]
Averbakh I (2012) Emergency path restoration problems. Discrete Optim. 9(1):58–64.
[10]
Averbakh I, Pereira J (2012) The flowtime network construction problem. IIE Trans. 44(8):681–694.
[11]
Averbakh I, Pereira J (2018) Lateness minimization in pairwise connectivity restoration problems. INFORMS J. Comput. 30(3):522–538.
[12]
Averbakh I, Pereira J (2020) Tree optimization based heuristics and metaheuristics in network construction problems. Preprint, submitted July 3, https://arxiv.org/abs/2007.03425.
[13]
Bulhoes T, Sadykov R, Uchoa E (2018) A branch-and-price algorithm for the minimum latency problem. Comput. Oper. Res. 93:66–78.
[14]
Carlson J, Eppstein D (2006) The weighted maximum-mean subtree and other bicriterion subtree problems. Arge L, Freivalds R, eds. Scand. Workshop Algorithm Theor. SWAT 2006, Lecture Notes in Computer Science, vol. 4059 (Springer, Berlin), 400–410.
[15]
Chaudhuri K, Godfrey B, Rao S, Talwar K (2003) Paths, trees, and minimum latency tours. Proc. 44th Annu. IEEE Sympos. Foundations Comput. Sci. 2003 (IEEE, Piscataway, NJ), 36–45.
[16]
Chekuri C, Motwani R, Natarajan B, Stein C (2001) Approximation techniques for average completion time scheduling. SIAM J. Comput. 31(1):146–166.
[17]
Correa JR, Fernandes CG, Wakabayashi Y (2010) Approximating a class of combinatorial problems with rational objective function. Math. Program. 124(1-2):255–269.
[18]
Correa JR, Schulz AS (2005) Single-machine scheduling with precedence constraints. Math. Oper. Res. 30(4):1005–1021.
[19]
Erdős P, Rényi A (1959) On random graphs. I. Publicationes Mathematicae 6(290-297):18.
[20]
Feige U, Lovász L, Tetali P (2004) Approximating min sum set cover. Algorithmica 40(4):219–234.
[21]
Fischetti M, Laporte G, Martello S (1993) The delivery man problem and cumulative matroids. Oper. Res. 41(6):1055–1064.
[22]
Fokkink R, Lidbetter T, Végh LA (2019) On submodular search and machine scheduling. Math. Oper. Res. 44(4):1431–1449.
[23]
Ford LR, Fulkerson DR (1956) Maximal flow through a network. Canad. J. Math. 8:399–404.
[24]
Gillies DW, Liu JWS (1995) Scheduling tasks with AND/OR precedence constraints. SIAM J. Comput. 24(4):797–810.
[25]
Goemans MX, Williamson DP (1995) A general approximation technique for constrained forest problems. SIAM J. Comput. 24(2):296–317.
[26]
Goldberg AV (1984) Finding a maximum density subgraph. Technical Report UCB/CSD-84-171, EECS Department, University of California, Berkeley.
[27]
Goldberg AV, Tarjan RE (1988) A new approach to the maximum-flow problem. J. ACM 35(4):921–940.
[28]
Happach F, Hellerstein L, Lidbetter T (2020) A general framework for approximating min sum ordering problems. Preprint, submitted April 13, https://arxiv.org/abs/2004.05954.
[29]
Hegde C, Indyk P, Schmidt L (2015) A nearly-linear time framework for graph-structured sparsity. Kambhampati S, ed. Proc. 32nd Internat. Conf. Machine Learning (JMLR, Palo Alto, CA), 928–937.
[30]
Hellerstein L, Lidbetter T, Pirutinsky D (2019) Solving zero-sum games using best-response oracles with applications to search games. Oper. Res. 67(3):731–743.
[31]
Hermans B, Leus R, Matuschke J (2019) Exact and approximation algorithms for the expanding search problem. Preprint, submitted November 20, https://arxiv.org/abs/1911.08959.</prpt>
[32]
Kao MJ, Katz B, Krug M, Lee D, Rutter I, Wagner D (2013) The density maximization problem in graphs. J. Comb. Optim. 26(4):723–754.
[33]
Khuller S, Saha B (2009) On finding dense subgraphs. Albers S, Marchetti-Spaccamela A, Matias Y, Nikoletseas S, Thomas W, eds. Internat. Colloq. Automata Languages Program., Lecture Notes in Computer Science, vol. 5555 (Springer, Berlin), 597–608.
[34]
Klau GW, Ljubić I, Mutzel P, Pferschy U, Weiskircher R (2003) The fractional prize-collecting Steiner tree problem on trees. Di Battista G, Zwick U, eds. Eur. Sympos. Algorithms ESA 2003, Lecture Notes in Computer Science, vol. 2832 (Springer, Berlin), 691–702 .
[35]
Klein PN, Ravi R (1995) A nearly best-possible approximation algorithm for node-weighted Steiner trees. J. Algorithms 19(1):104–115.
[36]
Koopman BO (1956a) The theory of search I: Kinematic bases. Oper. Res. 4(3):324–346.
[37]
Koopman BO (1956b) The theory of search II: Target detection. Oper. Res. 4(5):503–531.
[38]
Koopman BO (1957) The theory of search III: The optimum distribution of searching effort. Oper. Res. 5(5):613–626.
[39]
Koutsoupias E, Papadimitriou C, Yannakakis M (1996) Searching a fixed graph. Meyer F, Monien B, eds. Automata Languages Program. ICALP 1996, Lecture Notes in Computer Science, vol. 1099 (Springer, Berlin), 280–289.
[40]
Lau HC, Ngo TH, Nguyen BN (2006) Finding a length-constrained maximum-sum or maximum-density subtree and its application to logistics. Discrete Optim. 3(4):385–391.
[41]
Lee VE, Ruan N, Jin R, Aggarwal C (2010) A survey of algorithms for dense subgraph discovery. Aggarwal C, Wang H, eds. Managing and Mining Graph Data, Advances in Database Systems, vol. 40 (Springer, Boston), 303–336.
[42]
Leibovich E (2009) Approximating graph density problems. Unpublished master’s thesis, Open University of Israel, Raanana, Israel.
[43]
Li S, Huang S (2018) Multiple searchers searching for a randomly distributed immobile target on a unit network. Networks 71(1):60–80.
[44]
Magnanti TL, Wolsey LA (1995) Optimal trees. Ball MO, Magnanti TL, Monma CL, Nemhauser GL, eds. Network Models, Handbooks in Operations Research and Management Science, vol. 7 (Elsevier, Amsterdam), 503–615.
[45]
Méndez-Díaz I, Zabala P, Lucena A (2008) A new formulation for the traveling deliveryman problem. Discrete Appl. Math. 156(17):3223–3237.
[46]
Monma CL, Sidney JB (1979) Sequencing with series-parallel precedence constraints. Math. Oper. Res. 4(3):215–224.
[47]
Orlin JB, Punnen AP, Schulz AS (2004) Approximate local search in combinatorial optimization. SIAM J. Comput. 33(5):1201–1214.
[48]
Paul A, Freund D, Ferber A, Shmoys DB, Williamson DP (2020) Budgeted prize-collecting traveling salesman and minimum spanning tree problems. Math. Oper. Res. 45(2):576–590.
[49]
Potts CN (1980) An algorithm for the single machine sequencing problem with precedence constraints. Mathematical Programming Studies. 13:78–87.
[50]
Queyranne M, Wang Y (1991) Single-machine scheduling polyhedra with precedence constraints. Math. Oper. Res. 16(1):1–20.
[51]
Sidney JB (1975) Decomposition algorithms for single-machine sequencing with precedence relations and deferral costs. Oper. Res. 23(2):283–298.
[52]
Sitters R (2002) The minimum latency problem is NP-hard for weighted trees. Cook WJ, Schulz AS, eds. Internat. Conf. Integer Program. Combinatorial Optim. IPCO 2002, Lecture Notes in Computer Science, vol. 2337 (Springer, Berlin), 230–239.
[53]
Smith WE (1956) Various optimizers for single-stage production. Nav. Res. Logist. Quart. 3(1-2):59–66.
[54]
Stone LD (2007) Theory of Optimal Search, 2nd ed. (INFORMS, Catonsville, MD).
[55]
Stone LD, Royset JO, Washburn AR (2016) Optimal Search for Moving Targets (Springer, Cham, Switzerland).
[56]
Tan Y, Qiu F, Das AK, Kirschen DS, Arabshahi P, Wang J (2019) Scheduling post-disaster repairs in electricity distribution networks. IEEE Trans. Power Systems 34(4):2611–2621.
[57]
Trummel K, Weisinger J (1986) The complexity of the optimal searcher path problem. Oper. Res. 34(2):324–327.
Index Terms
- Exact and Approximation Algorithms for the Expanding Search Problem
Index terms have been assigned to the content through auto-classification.
Recommendations
Approximation algorithms for clique transversals on some graph classes
Given a graph G = ( V , E ) a clique is a maximal subset of pairwise adjacent vertices of V of size at least 2. A clique transversal is a subset of vertices that intersects the vertex set of each clique of G. Finding a minimum-cardinality clique ...
An approximation algorithm for the partial vertex cover problem in hypergraphs
Let $$\mathcal {H}=(V,\mathcal {E})$$H=(V,E) be a hypergraph with set of vertices $$V, n:=|V|$$V,n:=|V| and set of (hyper-)edges $$\mathcal {E}, m:=|\mathcal {E}|$$E,m:=|E|. Let $$l$$l be the maximum size of an edge, $$\varDelta $$Δ be the maximum ...
Heuristic and exact algorithms for the multi-pile vehicle routing problem
The multi-pile vehicle routing problem is a particular combination of loading and routing problems, in which items have to be loaded into different piles within vehicles, and then delivered with minimum cost. The problem is motivated by a real-world ...
Comments
Information & Contributors
Information
Published In
Copyright © 2021, INFORMS.
Publisher
INFORMS
Linthicum, MD, United States
Publication History
Published: 01 January 2022
Accepted: 13 November 2020
Received: 19 December 2019
Author Tags
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 04 Oct 2024
Other Metrics
Citations
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in