{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T17:46:35Z","timestamp":1648662395284},"reference-count":12,"publisher":"World Scientific Pub Co Pte Lt","issue":"05","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2004,10]]},"abstract":"<jats:p> In this paper, we consider a set of mobile nodes, each of which moves with constant velocity. We present algorithms to determine which of these mobile nodes can be captured the soonest by a set of one or more pursuers. We use a time parameterized R-tree (TPR-tree) to index these moving points. We then develop algorithms that operate on the TPR-tree to answer three query variations: (1) a single pursuer that is faster than all of the mobile nodes, (2) a single pursuer that is slower than some of the mobile nodes and (3) multiple pursuers. Experimental results show that our algorithms are simpler and faster than other approaches to solve the problem. <\/jats:p>","DOI":"10.1142\/s012905410400273x","type":"journal-article","created":{"date-parts":[[2004,10,22]],"date-time":"2004-10-22T07:32:49Z","timestamp":1098430369000},"page":"753-772","source":"Crossref","is-referenced-by-count":0,"title":["FAST PURSUIT OF MOBILE NODES USING TPR TREES"],"prefix":"10.1142","volume":"15","author":[{"given":"SAHAR","family":"IDWAN","sequence":"first","affiliation":[{"name":"Department of Mathematical and Computer Sciences, Colorado School of Mines, Golden, CO 80401, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"DINESH P.","family":"MEHTA","sequence":"additional","affiliation":[{"name":"Department of Mathematical and Computer Sciences, Colorado School of Mines, Golden, CO 80401, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"MARIO A.","family":"LOPEZ","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Denver, Denver, CO 80208, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf1","volume-title":"SODA: ACM-SIAM Symposium on Discrete Algorithms (A Conference on Theoretical and Experimental Analysis of Discrete Algorithms)","author":"Basch","year":"1997"},{"key":"rf2","volume-title":"Control and Optimization","author":"Isaacs R.","year":"1965"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1142\/S0218195998000163"},{"key":"rf4","volume-title":"Tech. Rep. MPI-I-94-149","author":"Devillers O.","year":"1994"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335427"},{"key":"rf6","volume-title":"Proc. ACM SIGMOD","author":"Guttman A.","year":"1984"},{"key":"rf7","unstructured":"R. S. N.\u00a0Beckmann, H. P.\u00a0Kriegel and B.\u00a0Seeger, ACM SIGMOD Conference (1990)\u00a0pp. 322\u2013331."},{"key":"rf8","unstructured":"J. M.\u00a0Hellerstein, J. F.\u00a0Naughton and A.\u00a0Pfeffer, Proc. 21st Int. Conf. Very Large Data Bases, eds. U.\u00a0Dayal, P. M. D.\u00a0Gray and S.\u00a0Nishio (Morgan Kaufmann, VLDB, 1995)\u00a0pp. 562\u2013573."},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1145\/290593.290596"},{"key":"rf10","unstructured":"G.\u00a0Hjaltason and H.\u00a0Samet, Proc. ACM SIGMOD (1998)\u00a0pp. 237\u2013248."},{"key":"rf11","unstructured":"Cecilia M.\u00a0Procopiuc, Pankaj K.\u00a0Agarwal and Sariel\u00a0Har-Peled, Proc. of the Workshop on Alg. Eng. and Experimentation (ALENEX, 2002)\u00a0pp. 562\u2013573."},{"key":"rf12","volume-title":"Proc. 29th Int. Conf. Very Large Data Bases","author":"Tao Y.","year":"1995"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S012905410400273X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T20:39:39Z","timestamp":1565123979000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S012905410400273X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,10]]},"references-count":12,"journal-issue":{"issue":"05","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2004,10]]}},"alternative-id":["10.1142\/S012905410400273X"],"URL":"https:\/\/doi.org\/10.1142\/s012905410400273x","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004,10]]}}}