Improved algorithms for the <mml:math altimg="si1.gif" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mi>k</mml:mi></mml:math> maximum-sums problems-Reference-Cited by-同舟云学术

Improved algorithms for the k maximum-sums problems

Published:2006-10 Issue:1-3 Volume:362 Page:162-170
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Cheng Chih-Huai,Chen Kuan-Yu,Tien Wen-Chin,Chao Kun-Mao

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference21 articles.

1. Longest biased interval and longest non-negative sum interval;Allison;Bioinformatics,2003

2. S.E. Bae, T. Takaoka, Algorithms for the Problem of k Maximum Sums and a VLSI Algorithm for the k Maximum Subarrays Problem, in: Proc. Seventh Internat. Symp. Parallel Architectures, Algorithms and Networks, 2004, pp. 247–253.

3. Improved Algorithms for the K-Maximum Subarray Problem for Small K;Bae,2005

4. F. Bengtsson, J. Chen, Efficient algorithms for k maximum sums, in: Proc. 15th Internat. Symp. on Algorithms and Computation, Lecture Notes in Computer Science, Vol. 3341, 2004, pp. 137–148.

5. Programming pearls: algorithm design techniques;Bentley;Commun. ACM,1984

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. k-Maximum Subarrays for Small k: Divide-and-Conquer Made Simpler;Lecture Notes in Computer Science;2019

2. Robust optimization in the presence of uncertainty: A generic approach;Journal of Computer and System Sciences;2018-06

3. Maximum-Sum Segments;Encyclopedia of Algorithms;2016

4. Maximum-Sum Segments;Encyclopedia of Algorithms;2015

5. Improved algorithms for the K overlapping maximum convex sum problem;Procedia Computer Science;2012