The maximal segment sum revisited
|Title:||The maximal segment sum revisited||Authors:||McLoughlin, Henry B.||Permanent link:||http://hdl.handle.net/10197/12351||Date:||Apr-2004||Online since:||2021-07-28T14:55:05Z||Abstract:||The maximum segment sum is a well known problem. In this report we revisit the problem and focus on the algebraic properties of the operators which we exploit in constructing the solution. This allows us to produce a generic algorithm which solves a family of problems of which the maximum segment sum is just one instance. At the end we list a number of other instances.||Type of material:||Technical Report||Publisher:||University College Dublin. School of Computer Science and Informatics||Series/Report no.:||UCD CSI Technical Reports; ucd-csi-2005-1||Copyright (published version):||2004 the Author||Keywords:||Computer programming; Generic algorithms; Operators; Algebraic properties||Other versions:||https://web.archive.org/web/20080226040105/http:/csiweb.ucd.ie/Research/TechnicalReports.html||Language:||en||Status of Item:||Not peer reviewed||This item is made available under a Creative Commons License:||https://creativecommons.org/licenses/by-nc-nd/3.0/ie/|
|Appears in Collections:||Computer Science and Informatics Technical Reports|
Show full item record
If you are a publisher or author and have copyright concerns for any item, please email email@example.com and the item will be withdrawn immediately. The author or person responsible for depositing the article will be contacted within one business day.