ALGORITHMS FOR K-DISJOINT MAXIMUM SUBARRAYS
From MaRDI portal
Publication:3434278
DOI10.1142/S012905410700470XzbMath1119.68220MaRDI QIDQ3434278
Publication date: 25 April 2007
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Related Items
Algorithms for finding the weight-constrained \(k\) longest paths in a tree and the length-constrained \(k\) maximum-sum segments of a sequence ⋮ EFFECT OF CORNER INFORMATION IN SIMULTANEOUS PLACEMENT OF k RECTANGLES AND TABLEAUX
Cites Work