Efficient algorithms for the maximum sum problems

DOI10.3390/A10010005MaRDI QIDQ1662587zbMATHOpenAlexFDO

Authors Sung Eun Bae, Tong-Wook Shinn, Tadao Takaoka

Publication date 20 August 2018

Published in Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3390/a10010005

zbMATH Keywords

parallel algorithmmaximum convex summaximum sub-array

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Nonnumerical algorithms (68W05) Parallel algorithms in computer science (68W10)

Recommendations

• Efficient algorithms for \(k\) maximum sums
• Algorithms and Computation
• Efficient Algorithms for the Sum Selection Problem and K Maximum Sums Problem
• Efficient algorithms for the sum selection problem and \(k\) maximum sums problem
• Improved algorithms for the \(k\) maximum-sums problems
• Algorithms and Computation
• Fast parallel algorithms for the maximum sum problem
• Efficient Computation of the Maximum of the Sum of Two Sequences and Applications
• A Linear Time Algorithm for the k Maximal Sums Problem
• Publication:4203809

Cites work

• scientific article; zbMATH DE number 1303586 (Why is no real title available?)
• An axiomatic basis for computer programming
• Data Mining with optimized two-dimensional association rules
• Efficient algorithms for the maximum subarray problem by distance matrix multiplication
• Verifying properties of parallel programs

Cited in

(3)

• Maximizing Range Sum in External Memory
• Algorithms and Computation
• Calculational developments of new parallel algorithms for size-constrained maximum-sum segment problems

This page was built for publication: Efficient algorithms for the maximum sum problems

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