A Linear Time Algorithm for the k Maximal Sums Problem

DOI10.1007/978-3-540-74456-6_40zbMath1147.68862OpenAlexW1855229140WikidataQ56449776 ScholiaQ56449776MaRDI QIDQ3525591

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

Publication date: 17 September 2008

Published in: Mathematical Foundations of Computer Science 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74456-6_40

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Nonnumerical algorithms (68W05)

Related Items (6)

Insertion and sorting in a sequence of numbers minimizing the maximum sum of a contiguous subsequence ⋮ A Sub-cubic Time Algorithm for the k-Maximum Subarray Problem ⋮ Weight-constrained and density-constrained paths in a tree: enumerating, counting, and \(k\)-maximum density paths ⋮ Linear time computation of the maximal linear and circular sums of multiple independent insertions into a sequence ⋮ Algorithms for finding the weight-constrained \(k\) longest paths in a tree and the length-constrained \(k\) maximum-sum segments of a sequence ⋮ Optimal algorithms for the average-constrained maximum-sum segment problem

This page was built for publication: A Linear Time Algorithm for the k Maximal Sums Problem