Selecting Sums in Arrays

DOI10.1007/978-3-540-92182-0_12zbMath1183.68717OpenAlexW1536974262MaRDI QIDQ3596710

Allan Grønlund Jørgensen, Gerth Stølting Brodal

Publication date: 29 January 2009

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-92182-0_12

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Combinatorics in computer science (68R05)

Related Items (2)

Insertion and sorting in a sequence of numbers minimizing the maximum sum of a contiguous subsequence ⋮ Linear time computation of the maximal linear and circular sums of multiple independent insertions into a sequence

This page was built for publication: Selecting Sums in Arrays