Ranking \(k\) maximum sums
type: Item
instance of: scholarly article
title: Ranking \(k\) maximum sums
zbMATH Open document ID: 1117.68086
author: Fredrik Bengtsson
author: Jingsen Chen
published in: Theoretical Computer Science
publication date: 2007-06-06T00:00:00Z
Mathematics Subject Classification ID: 68W05
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 5161895
zbMATH Keywords: maximum sum subsequence
zbMATH Keywords: maximum sum subarray
zbMATH Keywords: algorithm design
MaRDI profile type: Publication
full work available at URL: j.tcs.2007.03.011
OpenAlex ID: W2077527465
cites work: APPLICATION OF BROADCASTING WITH SELECTIVE REDUCTION TO THE MAXIMAL SUM SUBSEGMENT PROBLEM
cites work: Computing and Combinatorics
cites work: Efficient algorithms for \(k\) maximum sums
cites work: Algorithms and Computation
cites work: Q3619797
cites work: The complexity of selection and ranking in X+Y and matrices with sorted columns
cites work: Generalized Selection and Ranking: Sorted Matrices
cites work: Pattern analysis. Lectures in pattern theory. Vol. II
cites work: A note on a standard strategy for developing loop invariants and loops
cites work: Applications of a strategy for designing divide-and-conquer algorithms
cites work: Q4250212
DOI: 10.1016/J.TCS.2007.03.011
description: scientific article; zbMATH DE number 5161895