Efficient algorithms for the sum selection problem and K maximum sums problem

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

Volumn 4288 LNCS, Issue , 2006, Pages 460-473

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

^a NATIONAL TAIWAN UNIVERSITY   (Taiwan)

^b INSTITUTE OF INFORMATION SCIENCE   (Taiwan)

Author keywords

K maximum sums problem; Maximum sum problem; Maximum sum subarray problem; Sum selection problem

Indexed keywords

DETERMINISTIC ALGORITHMS; EFFICIENT ALGORITHM; POSITIVE INTEGERS; RANDOMIZED ALGORITHMS; REAL NUMBER; SELECTION PROBLEMS; SUBARRAY; WORST CASE;

ALGORITHMS; COMPUTATION THEORY; NUMBER THEORY;

COMPUTATIONAL EFFICIENCY;

EID: 58549103171     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11940128_47     Document Type: Conference Paper

References (20)

1. 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.
2. M. Ajtei, J. Komlós, E. Szemerédi. An O(nlogn) sorting networks. Combinatorica, 3:1-19, 1983.
3. AIk, 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.
4. 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.
5. Bengtsson, F., Chen, J. Efficient Algorithms for K Maximum Sums. Algorithms and Computation, 15th International Symposium, ISAAC 2004, 137-148.
6. Bentley, J. Programming perais: algorithm design techniques. Commun. ACM, 27, 9:865-873, 1984.
7. Bentley, J. Programming perais: algorithm design techniques. Commun. ACM, 27, 11:1087-1092, 1984.
8. Chih-Huai Cheng, Kuan-Yu Chen, Wen-Chin Tien, and Kun-Mao Chao Improved Algorithms for the k Maximum-Sums Problems. Algorithms and Computation, 16th International Symposium, ISAAC 2005.
9. H. Brönnimann, B. Chazelle. Optimal slope selection via cuttings. Computational Geometry, 10:23-29, 1998.
10. R. Cole, J. S. Salowe, W. L. Steiger, and E. Szemeredi. An optimal-time algorithm for slope selection. SIAM Journal on Computing, 18(4):792-810, 1989.
11. R. Cole. Slowing down sorign networks to obtain faster sorting algorithm. Journal of the Association for Computing Machinery, Vol.34, No.1:200-208, 1987.
12. 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.
13. Gries, D. A note on the standard strategy for developing loop invariants and loops. Science of Computer Programming, 2:207-214, 1982. (Pubitemid 14566076)
14. Tien-Ching Lin, D. T. Lee Randomized algorithm for the Sum Selection Problem. Algorithms and Computation, 16th International Symposium, ISAAC 2005, 515-523.
15. N. Megiddo. Applying parallel computation algorithms in the design of serial algorithm. Journal of the Association for Computing Machinery, Vol.30, No.4:852-865, 1983.
16. Perumalla, K., Deo, N. Parallel algorithms for maximum subsequence and maximum subarray. Parallel Processing Letters, 5:367-373, 1995.
17. 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.
18. Smith, D. Applications of a strategy for designing divide-and-conquer algorithms. Science of Computer Programming, 8:213-229, 1987. (Pubitemid 17617707)
19. 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.
20. Takaoka, T. Efficient algorithms for the maximum dubarray problem by fistance matrix multiplication. Proceedings of the 2002 australian theory symposium, 189-198, 2002.