Next Article in Journal
Backtracking-Based Iterative Regularization Method for Image Compressive Sensing Recovery
Previous Article in Journal
Using Force-Field Grids for Sampling Translation/Rotation of Partially Rigid Macromolecules
Article Menu

Export Article

Open AccessArticle
Algorithms 2017, 10(1), 5; doi:10.3390/a10010005

Efficient Algorithms for the Maximum Sum Problems

1
Algorithm Research Institute, Christchurch 8053, New Zealand
2
Computer Science and Software Engineering, University of Canterbury, Christchurch 8140, New Zealand
*
Author to whom correspondence should be addressed.
Academic Editors: Bruno Carpentieri and Spyros Kontogiannis
Received: 9 August 2016 / Revised: 2 December 2016 / Accepted: 26 December 2016 / Published: 4 January 2017
View Full-Text   |   Download PDF [1175 KB, uploaded 4 January 2017]   |  

Abstract

We present efficient sequential and parallel algorithms for the maximum sum (MS) problem, which is to maximize the sum of some shape in the data array. We deal with two MS problems; the maximum subarray (MSA) problem and the maximum convex sum (MCS) problem. In the MSA problem, we find a rectangular part within the given data array that maximizes the sum in it. The MCS problem is to find a convex shape rather than a rectangular shape that maximizes the sum. Thus, MCS is a generalization of MSA. For the MSA problem, O ( n ) time parallel algorithms are already known on an ( n , n ) 2D array of processors. We improve the communication steps from 2 n 1 to n, which is optimal. For the MCS problem, we achieve the asymptotic time bound of O ( n ) on an ( n , n ) 2D array of processors. We provide rigorous proofs for the correctness of our parallel algorithm based on Hoare logic and also provide some experimental results of our algorithm that are gathered from the Blue Gene/P super computer. Furthermore, we briefly describe how to compute the actual shape of the maximum convex sum. View Full-Text
Keywords: maximum sub-array; maximum convex sum; parallel algorithm maximum sub-array; maximum convex sum; parallel algorithm
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).

Scifeed alert for new publications

Never miss any articles matching your research from any publisher
  • Get alerts for new papers matching your research
  • Find out the new papers from selected authors
  • Updated daily for 49'000+ journals and 6000+ publishers
  • Define your Scifeed now

SciFeed Share & Cite This Article

MDPI and ACS Style

Bae, S.E.; Shinn, T.-W.; Takaoka, T. Efficient Algorithms for the Maximum Sum Problems. Algorithms 2017, 10, 5.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top