Insertion and sorting in a sequence of numbers minimizing the maximum sum of a contiguous subsequence

DOI10.1016/J.JDA.2013.03.003zbMath1334.68086arXiv1210.5955OpenAlexW3105360089MaRDI QIDQ396653

Críston P. de Souza, Ricardo C. Corrêa, Pablo M. S. Farias

Publication date: 13 August 2014

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1210.5955

zbMATH Keywords

insertion in a sequencemaximum renewal cumulative costmaximum scoring subsequencemaximum sum problem

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Algorithms on strings (68W32)

Related Items (1)

Linear time computation of the maximal linear and circular sums of multiple independent insertions into a sequence

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on a standard strategy for developing loop invariants and loops
• Sequencing to minimize the maximum renewal cumulative cost
• A Linear Time Algorithm for the k Maximal Sums Problem
• A Parallel Algorithm for Finding All Successive Minimal Maximum Subsequences
• Selecting Sums in Arrays
• Bounds on Multiprocessing Timing Anomalies

This page was built for publication: Insertion and sorting in a sequence of numbers minimizing the maximum sum of a contiguous subsequence