ALGORITHMS FOR K-DISJOINT MAXIMUM SUBARRAYS

DOI10.1142/S012905410700470XMaRDI QIDQ3434278zbMATH OpenFDO

Authors Sung Eun Bae, Tadao Takaoka

Publication date 25 April 2007

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S012905410700470X

zbMATH Keywords

disjoint setsmaximum subarray problemranking \(K\) maximum sumsunion/find problem

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Recommendations

• Algorithm for K Disjoint Maximum Subarrays
• Computing and Combinatorics
• Algorithms and Computation
• A Sub-cubic Time Algorithm for the k-Maximum Subarray Problem
• Improved algorithms for the \(k\) maximum-sums problems

Cites work

• A complement to Tarjan's result about the lower bound on the complexity of the set union problem
• An improved equivalence algorithm
• Efficiency of a Good But Not Linear Set Union Algorithm
• scientific article; zbMATH DE number 1052006 (Why is no real title available?)
• Set Merging Algorithms
• Time bounds for selection
• Worst-case Analysis of Set Union Algorithms

Cited in

(4)

• Effect of corner information in simultaneous placement of k rectangles and tableaux
• Algorithm for K Disjoint Maximum Subarrays
• A Sub-cubic Time Algorithm for the k-Maximum Subarray Problem
• Algorithms for finding the weight-constrained \(k\) longest paths in a tree and the length-constrained \(k\) maximum-sum segments of a sequence

This page was built for publication: ALGORITHMS FOR K-DISJOINT MAXIMUM SUBARRAYS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3434278)