Randomized algorithm for the sum selection problem

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

Volumn 3827 LNCS, Issue , 2005, Pages 515-523

  Lin, Tien Ching ^a,b   Lee, D T ^a,b  

^a NATIONAL TAIWAN UNIVERSITY   (Taiwan)

^b INSTITUTE OF INFORMATION SCIENCE   (Taiwan)

Author keywords

Computational geometry; K maximum sums problem; Maximum sum problem; Maximum sum subarray problem; Order statistic tree; Random sampling; Randomized algorithm; Sum selection problem

Indexed keywords

COMPUTATIONAL GEOMETRY; NUMBER THEORY; PROBLEM SOLVING;

K MAXIMUM SUMS PROBLEM; MAXIMUM SUM PROBLEM; MAXIMUM SUM SUBARRAY PROBLEM; ORDER-STATISTIC TREE; RANDOM SAMPLING; RANDOMIZED ALGORITHMS; SUM SELECTION PROBLEM;

ALGORITHMS;

EID: 33744950139     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11602613_52     Document Type: Conference Paper

References (18)

1. Bentley, J. Programming perals: algorithm design techniques. Commun. ACM, 27, 9:865-873, 1984.
2. Bentley, J. Programming perals: algorithm design techniques. Commun. ACM, 27, 11:1087-1092, 1984.
3. Gries, D. A note on the standard strategy for developing loop invariants and loops. Science of Computer Programming, 2:207-214, 1982.
4. Smith, D. Applications of a strategy for designing divide-and-conquer algorithms. Science of Computer Programming, 8:213-229, 1987.
5. Tamaki, H., Tokuyama, T. Algorithms for the maximum subarray problem based on matrix multiplication. Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms, 446-452, 1998.
6. Takaoka, T. Efficient algorithms for the maximum dubarray problem by fistance matrix multiplication. Proceedings of the 2002 australian theory symposium, 189-198, 2002.
7. Alk, S., Guenther, G. Application of broadcasting with selective reduction to the maximal sum subsegment problem. International journal of high speed computating, 3:107-119, 1991.
8. Qiu, K., Alk, S. Parallel maximum sum algorithms on interconnection networks. Technical Report No. 99-431, Jodrey School of Computer Science, Acadia University, Canada, 1999.
9. Perumalla, K., Deo, N. Parallel algorithms for maximum subsequence and maximum subarray. Parallel Processing Letters, 5:367-373, 1995.
10. Fukuda, T., Morimoto, Y., Morishita, S. Tokuyama, T. Mining association rules between sets of items in large databases. Proceedings of the 1996 ACM SIGMOD international conference on management of data, 13-23, 1996.
11. Agrawal, R., Imielinski, T. Swami, A. Data mining using two-dimensional optimized association rules: scheme, algorithms, and visualization. Proceedings of the 1993 ACM SIGMOD international conference on management of data, 207-216, 1993.
12. Bae, S. E., Takaoka, T. Algorithms for the problem of k maximum sums and a VLSI algorithm for the k maximum subarrays problem. 2004 International Symposium on Parallel Architectures, Algorithms and Networks, 247-253, 2004.
13. Bengtsson, F., Chen, J. Efficient Algorithms for k Maximum Sums. Algorithms and Computation, 15th International Symposium, ISAAC 2004, 137-148.
14. Michael H. Dillencourt, David M. Mount, and Nathan S. Netanyahu. A Randomized Algorithm for slope selection. International Journal of Computational Geometry and Applications, vol. 2, No. 1:1-27, 1992.
15. J. Matoušek. Randomized optimal algorithm for slope selection. Information Processing Letters, 39(4): 183-187, 1991.
16. Thomas. H. Cormen, Charles. E. Leiserson. and Ronald L. Rivest. Introdution to Algorithms, MIT Press.
17. Noga Alon, Joel H. Spencer and Paul Erdǒs. The Probabilistic Method, Wiley-Interscience Series.
18. Rajeev Motwani, Probhakar Raghavan. Randomized Algorithms, Cambridge.