Untangled monotonic chains and adaptive range search

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5878 LNCS, Issue , 2009, Pages 203-212

  Arroyuelo, Diego ^a   Claude, Francisco ^b   Dorrigiv, Reza ^b   Durocher, Stephane ^c   He, Meng ^b   López Ortiz, Alejandro ^b   Munro, J Ian ^b   Nicholson, Patrick K ^b   Salinger, Alejandro ^b   Skala, Matthew ^b,d  

^a YAHOO RESEARCH   (United States)

^b UNIVERSITY OF WATERLOO   (Canada)

^c UNIVERSITY OF MANITOBA   (Canada)

^d UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

DATA POINTS; LINEAR SPACES; MONOTONIC CHAIN; NOVEL ALGORITHM; ORTHOGONAL RANGE SEARCH; POINT SET; QUERY TIME; RANGE QUERY; RANGE SEARCH; SEARCH PERFORMANCE; WORST CASE; WORST-CASE PERFORMANCE;

ALGORITHMS; COMPUTATION THEORY; GEOMETRY; QUERY LANGUAGES;

DATA STRUCTURES;

EID: 75649140916     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-10631-6_22     Document Type: Conference Paper

References (14)

1. Arge, L., de Berg, M., Haverkort, H.J., Yi, K.: The priority R-tree: A practically efficient and worst-case optimal R-tree. ACM Transactions on Algorithms 4(1) (2008)
2. Bentley, J.L.: Multidimensional binary search trees used for associative searching. Communications of the ACM 18(9), 509-517 (1975)
3. Bloniarz, P.A., Ravi, S.S.: An Ω(n log n) lower bound for decomposing a set of points into chains. Information Processing Letters 31(6), 319-322 (1989)
4. Chazelle, B., Guibas, L.J.: Fractional cascading: I. a data structuring technique. Algorithmica 1(2), 133-162 (1986)
5. Di Stefano, G., Krause, S., Lübbecke, M.E., Zimmermann, U.T.: On minimum k-modal partitions of permutations. Journal of Discrete Algorithms 6(3), 381-392 (2008)
6. Fomin, F.V., Kratsch, D., Novelli, J.C.: Approximating minimum cocolorings. Information Processing Letters 84(5), 285-290 (2002)
7. Guttman, A.: R-trees: a dynamic index structure for spatial searching. SIGMOD Record (ACM Special Interest Group on Management of Data) 14(2), 47-57 (1984)
8. Kanth, K.V.R., Singh, A.: Optimal dynamic range searching in non-replicating index structures. In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol. 1540, pp. 257-276. Springer, Heidelberg (1999)
9. Lueker, G.S.: A data structure for orthogonal range queries. In: 19th Annual Symposium on Foundations of Computer Science (FOCS 1978), Long Beach, Ca., USA, pp. 28-34. IEEE Computer Society Press, Los Alamitos (1978)
10. Munro, J.I.: A multikey search problem. In: Proceedings of the 17th Allerton Conference on Communication, Control and Computing, University of Illinois, pp. 241-244 (1979)
11. Nekrich, Y.: Orthogonal range searching in linear and almost-linear space. Computational Geometry 42(4), 342-351 (2009)
12. Supowit, K.J.: Decomposing a set of points into chains, with applications to permutation and circle graphs. Information Processing Letters 21(5), 249-252 (1985)
13. van Leeuwen, J., Schoone, A.A.: Untangling a traveling salesman tour in the plane. In: Proceedings of the 7th Conference on Graphtheoretic Concepts in Computer Science (WG 1981), München, Germany, pp. 87-98. Hanser Verlag (1981)
14. Yang, B., Chen, J., Lu, E., Zheng, S.Q.: A comparative study of efficient algorithms for partitioning a sequence into monotone subsequences. In: Cai, J.-Y., Cooper, S.B., Zhu, H. (eds.) TAMC 2007. LNCS, vol. 4484, pp. 46-57. Springer, Heidelberg (2007)