Algorithm for K Disjoint Maximum Subarrays

DOI10.1007/11758501_80MaRDI QIDQ3545047zbMATH OpenOpenAlexFDO

Authors Sung Eun Bae, Tadao Takaoka

Publication date 9 December 2008

Published in Computational Science – ICCS 2006 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11758501_80

Mathematics Subject Classification ID

Analysis of algorithms (68W40)

Recommendations

• ALGORITHMS FOR K-DISJOINT MAXIMUM SUBARRAYS
• Computing and Combinatorics
• Algorithms and Computation
• A Sub-cubic Time Algorithm for the k-Maximum Subarray Problem
• A Linear Time Algorithm for the k Maximal Sums Problem

Cited in

(3)

• Efficient algorithms for the maximum subarray problem by distance matrix multiplication
• ALGORITHMS FOR K-DISJOINT MAXIMUM SUBARRAYS
• A Sub-cubic Time Algorithm for the k-Maximum Subarray Problem

This page was built for publication: Algorithm for K Disjoint Maximum Subarrays

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3545047)