ALGORITHMS FOR K-DISJOINT MAXIMUM SUBARRAYS

DOI10.1142/S012905410700470XzbMATH Open1119.68220MaRDI QIDQ3434278FDOQ3434278

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)

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

zbMATH Keywords

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

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Cites Work

• Title not available (Why is that?)
• Efficiency of a Good But Not Linear Set Union Algorithm
• Worst-case Analysis of Set Union Algorithms
• Time bounds for selection
• An improved equivalence algorithm
• Set Merging Algorithms
• A complement to Tarjan's result about the lower bound on the complexity of the set union problem

Cited In (4)

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

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)