Efficient algorithms for the maximum sum problems

DOI10.3390/A10010005zbMATH Open1461.68250OpenAlexW2570190023MaRDI QIDQ1662587FDOQ1662587

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

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

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)

Cites Work

• An axiomatic basis for computer programming
• Verifying properties of parallel programs
• Data Mining with optimized two-dimensional association rules
• Title not available (Why is that?)
• Efficient algorithms for the maximum subarray problem by distance matrix multiplication

Cited In (2)

• Algorithms and Computation
• Maximizing Range Sum in External Memory

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)